Jump Game II — Go Coding Problem
Difficulty: medium | Category: greedy
Problem Description
You are given a 0-indexed array of integers `nums` of length `n`. You are initially positioned at `nums[0]`. Each element `nums[i]` represents the maximum length of a forward jump from index `i`. Return the **minimum number of jumps** to reach `nums[n-1]`. The test cases are generated such that you can always reach `nums[n-1]`. **Approach:** Greedy — track current reach and end of current jump level.
Examples
Example 1
Input: nums = [2,3,1,1,4]
Output: 2
Explanation: Minimum is 2 jumps: index 0 → 1 → 4.
Example 2
Input: nums = [2,3,0,1,4]
Output: 2