solve(nums) — you start on the first index; nums[i] is the maximum number of
steps you can jump forward from index i. Return true if you can reach the last
index.
No search is needed: sweep left to right while tracking the **farthest index
reachable so far**. If you ever stand on an index beyond that frontier, you are stuck.
Examples
solve([2,3,1,1,4]) → true
solve([3,2,1,0,4]) → false // every route ends on the 0 at index 3
solve([0]) → true
solve([0,1]) → falseSample tests