Minimum jumps to last index
Each value is the max jump length from that index. Return the minimum number of jumps to reach the last index (always reachable).
Implement
jump_game_ii(nums: list[int]) → intExamples
in
[[2,3,1,1,4]]out2What 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 35 min
solution.py
InputExpectedGot
[[2,3,1,1,4]]2not run yetsample