Given an array where nums[i] is the max jump from position i, return the minimum number of jumps to reach the last index.
Input: nums=[2,3,1,1,4] Output: 2 (jump from 0β1β4) Input: nums=[2,3,0,1,4] Output: 2
Unlock hints progressively β start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features