codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsJump Game

Jump Game

Medium
GreedyDynamic Programming

Given an integer array nums, return true if you can reach the last index starting from index 0, or false otherwise.

Each element in the array represents your maximum jump length at that position.

 

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.

 

Constraints:

  • 1 <= nums.length <= 104
  • 0 <= nums[i] <= 105

Related Problems

View all
Maximum Subarray
Medium•Greedy
Jump Game II
Medium•Greedy
Gas Station
Medium•Greedy
Hand of Straights
Medium•Greedy
Merge Triplets to Form Target Triplet
Medium•Greedy
Partition Labels
Medium•Greedy
Input:
nums = [2,3,1,1,4]