Jump game
Each value is the max jump length from that index. Return whether you can reach the last index starting from index 0.
Implement
jump_game(nums: list[int]) → boolExamples
in
[[2,3,1,1,4]]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[2,3,1,1,4]]truenot run yetsample