Problems / Jump Game
Medium

Jump Game

Medium 0 submissions 25 coins +100 XP
Array Dynamic Programming
Problem Description
You are given an integer array `nums`. You are initially positioned at the array's **first index**, and each element in the array represents your maximum jump length at that position. Return `True` if you can reach the last index, or `False` otherwise. **Example 1:** Input: nums = [2,3,1,1,4] Output: True Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index. **Example 2:** Input: nums = [3,2,1,0,4] Output: False Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index. **Example 3:** Input: nums = [0] Output: True Explanation: You are already at the last index. **Hint:** Track the maximum reachable index. If at any point your current index exceeds this maximum, return False.
Constraints
- 1 <= nums.length <= 10^4 - 0 <= nums[i] <= 10^5

Need help?

Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.

Video Call Whiteboard Live Coding Screen Share