All challenges
Algorithm challenge · DSA
Jump Game II
Difficulty
hard
Time
~35m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#greedy#arrays
Mission file // read carefullyhard
Given an array nums where nums[i] is the maximum jump length from index i, return the minimum number of jumps to reach the last index (assume it is always reachable).
Example
nums = [2,3,1,1,4] => 2
Build with
jump(nums: int[]) → intPythonJavaScriptTypeScriptGoJavaC++Rust
5 tests · 2 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.