Jump game minimum jumps
Given an array of non-negative integers where each value is the maximum forward jump length from that index, return the minimum number of jumps to reach the last index, starting from index 0. Assume the last index is always reachable. The array has at least one element (a single element needs 0 jumps).
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