Build the PrimitiveMedium
Jump Game
Write `can_jump(nums)` where each value is the maximum jump length from that index. Return `True` if the last index is reachable from index 0.
can_jump([2,3,1,1,4]) -> True
can_jump([3,2,1,0,4]) -> False
Keep the furthest index reached so far. If you ever stand at an index beyond it, you are stuck and can stop. DP over every index works and is quadratic; this is one pass.
What to expect: A timer starts when you begin. Edit the starter code, run it against the test suite as many times as you like, then finish when you're done. The reference solution and interviewer follow-up questions unlock only after you finish.