Jump game
Each element of an array is the maximum jump length from that position. Starting at index 0, decide whether you can reach the last index. Solve it greedily in O(n) by tracking the furthest reachable index.
No answer yet. Write the first one; the best answer gets endorsed.