class Solution:
    def jump(self, nums: List[int]) -> int:
        dp = [len(nums) for i in range(len(nums))]
        dp[len(nums) - 1] = 0;
        for  i in range(len(nums) - 2, -1, -1):
            for j in range(i + 1, i + nums[i] + 1):
                if j >= len(nums):
                    break
                dp[i] = min(dp[i], 1 + dp[j])
        return dp[0];