You are given a 0-indexed array nums where nums[i] is the maximum jump length from index i. You start at index 0 and want to reach the last index. The test data guarantees you can.
Return the minimum number of jumps to reach the last index.
We use analytics and advertising cookies to understand how the site is used and whether our ads on Facebook and Instagram work. They are set only if you accept. See our Privacy Policy for details.
You are given a 0-indexed array nums where nums[i] is the maximum jump length from index i. You start at index 0 and want to reach the last index. The test data guarantees you can.
Return the minimum number of jumps to reach the last index.
A medium greedy problem, graded against 7 test cases (5 of them hidden).
Take the locally best option each step and prove it stays globally optimal.
Reach for it when you see: Interval scheduling, jump/reachability questions, or an optimisation with an obvious local choice.
More Greedy problems →Greedy BFS over ranges. Sweep indices tracking `farthest` reachable. Each time you hit `curEnd` (the boundary of the current jump), increment the jump count and extend the boundary to `farthest`. This yields the minimum jumps in linear time.
Time: O(n). Space: O(1).
The full reference solution in every supported language stays in the editor above - reveal it there once you have had a real attempt.
Read off this problem's own test suite, so these are the cases a submission actually has to survive.
These apply to the pattern as a whole, not just this problem.