Find maximum profit from one buy and one sell (buy before sell).
Can you reach the last index? Each element is the max jump length from that position.
Find starting station for a complete circuit, or -1 if impossible.
Partition string into most parts so each letter appears in at most one part.
Minimum intervals to remove so the rest don't overlap.
Given intervals, find the minimum number of intervals to remove to make the rest non-overlapping.
Given tasks with a cooldown period n between same tasks, find the minimum time to finish all tasks.
Given array where each element is max jump length, find minimum jumps to reach the last index.
Given gas stations in a circle with gas[i] and cost[i], find the starting station to complete the circuit, or -1.
Partition a string so each letter appears in at most one part. Maximize the number of parts.
Given a string with '(', ')', and '*' (* can be '(', ')' or empty), determine if it's valid.