Given an array of non-negative integers, you are initially positioned at the first index of the array.

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

Determine if you are able to reach the last index.

Example 1:

Input:[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:[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.




We encourage you to write a comment if you have a better solution or having any doubt on the above topic.

2 Thoughts on “LeetCode – Jump Game – 30Days Challenge”

  • Hi Navneet,

    Solution is pretty simple and understandable.

    Can you please brief about the reasoning behind it in terms of how you come up with the approach ?

    Kunal Prajapati

Leave a Reply

Your email address will not be published. Required fields are marked *