Jump game minimum jumps
You are given an array where nums[i] is the maximum forward jump length from index i. Starting at index 0, return the minimum number of jumps needed to reach the last index. It is guaranteed the last index is reachable. Constraints: 1 <= n <= 10^4, 0 <= nums[i] <= 1000.
Implement
min_jumps(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 25 min
solution.py
InputExpectedGot
[[2,3,1,1,4]]2not run yetsample