Find the best day to buy and the best day to sell a stock to make the most money.
Starting at the first position, check if you can hop to the end given each position's maximum jump distance.
Find which gas station to start at so you can drive around a circular route without running out of fuel.
Split a string into the most pieces possible where no letter appears in more than one piece.
Remove the fewest intervals so that none of the remaining ones overlap.
Find the fewest jumps needed to get from the start to the end of the array.
Find the gas station to start at so you can drive around a circular route without running out of fuel.
Split a string into the most pieces possible where no letter appears in more than one piece.
Check if a string of parentheses with wildcards (*) can be made valid.