How should I practice Jump Game II?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Navi phone screen problems in FastPrep.

Is Jump Game II associated with Navi?

FastPrep tags this as a Navi phone screen coding practice problem when the problem catalog has that company and stage context.

Jump Game II

Navi● MediumFULLTIMEPHONE SCREEN

Learn

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.

Source note: Author-written prompt excerpt retained for source fidelity.