Top 150 InterviewEasy

Jump Game

Detailed guide and Python implementation for the 'Jump Game' problem.

Problem Statement

Easy

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.

Write a function canJump(nums: List[int]) -> bool.

Constraints
  • 1 <= len(nums) <= 10^4
  • 0 <= nums[i] <= 10^5

Examples

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. Its maximum jump length is 0, which makes it impossible to reach the last index.

Need a Hint?
Consider using Greedy-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.