Minimum Jumps to Reach End

Problem

Given an integer array nums where nums[i] is the maximum jump length from index i, return the minimum number of jumps needed to reach the last index starting from index 0. If the last index cannot be reached, return -1.

Constraints

• 1 <= len(nums) <= 10^5
• 0 <= nums[i] <= 10^5
• Return 0 when the array has only one element
• Return -1 if the last index cannot be reached