#+ANKI_DECK: study_deck_02
* TODO 0055. Jump Game :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0055. Jump Game][0055. Jump Game]]
:END:

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:*


#+begin_src
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.
#+end_src


*Example 2:*


#+begin_src
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.
#+end_src


*Constraints:*

 - ~1 <= nums.length <= 10^{4}~

 - ~0 <= nums[i] <= 10^{5}~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python
class Solution:
    def canJump(self, nums: List[int]) -> bool:
#+end_src

** TODO C++
#+begin_src cpp
class Solution {
public:
    bool canJump(vector<int>& nums) {
        
    }
};
#+end_src