Jump Game Problem

Jump Game Problem — ExecCode Medium DSA Practice

Solve the Jump Game problem on ExecCode. Free online medium DSA practice in DP. Write and run code in Java, C++, Python — no signup required to run.

Problem description

You are given an integer array nums. You are initially positioned at the array's first index, and each element nums[i] represents your maximum jump length from that position. Return true if you can reach the last index, or false otherwise.

Examples

Input nums = [2, 3, 1, 1, 4]; Output true. Input nums = [3, 2, 1, 0, 4]; Output false. Input nums = [0]; Output true

Constraints

1 ≤ nums.length ≤ 10⁴ 0 ≤ nums[i] ≤ 10⁵

Practice Jump Game free on ExecCode. Browse DSA problems, topic map, and placement guides.