LeetCode — Jump Game (Blind Curated 26)

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:

Example 2:

Constraints:

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

Solution:

Time complexity: O(N)

Space complexity: O(1)

LC — Jump Game (Blind Curated 26)

--

--

👨‍💻

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store