CodingMediumcod-g761

Subject GreedyLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[2,3,1,1,4]]out2

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.