Given `nums` where each value is the maximum jump length from that index, implement `canJump(nums)` returning whether you can reach the last index starting from index 0.
+ 1 hidden test run on Submit.
Carrying the farthest reach in one pass decides reachability in O(n) time.
Run your code to see results.