FastPrepJump Game II
Problem · Array

Jump Game II

Learn this problem
● MediumOracle logoOracleFULLTIMEONSITE INTERVIEW

Problem statement

You are given a zero-indexed array nums. You start at index 0, and nums[i] is the maximum number of indices you may move forward from index i.

Return the minimum number of jumps needed to reach the final index. The input guarantees that the final index is reachable.

Function

jump(nums: int[]) → int

Examples

Example 1

nums = [2,3,1,1,4]return = 2

Jump from index 0 to index 1, then to the final index.

Example 2

nums = [2,3,0,1,4]return = 2

The same two-jump route through index 1 reaches the end.

Example 3

nums = [0]return = 0

No jump is needed when the array has one element.

Constraints

  • 1 <= nums.length <= 10^4.
  • 0 <= nums[i] <= 1000.
  • The final index is reachable from index 0.

More Oracle problems

drafts saved locally
public int jump(int[] nums) {
    // write your code here
}
nums[2,3,1,1,4]
expected2
checking account