<p>You are given an integer array <code>nums</code>. You are initially positioned at the array&#39;s <strong>first index</strong>, and each element in the array represents your maximum jump length at that position.</p>

<p>Return <code>true</code><em> if you can reach the last index, or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [2,3,1,1,4]
<strong>Output:</strong> true
<strong>Explanation:</strong> Jump 1 step from index 0 to 1, then 3 steps to the last index.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,2,1,0,4]
<strong>Output:</strong> false
<strong>Explanation:</strong> 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.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution:
    from collections import deque
    def canJump(self, nums: List[int]) -> bool:
        d = deque([0])
        visited = {0}
        while d:
            curIdx = d.popleft()
            if curIdx >= len(nums) - 1:
                return True
            elem = nums[curIdx]
            for num in range(elem+1):
                if curIdx+num not in visited:
                    if curIdx+num >= len(nums) - 1:
                        return True
                    d.append(curIdx+num)
                    visited.add(curIdx+num)

        return False 



        
        # stack = []
        # visited = {0}
        # while stack:
            
        # stack = [0]
        # visited = {0}
        # while stack:
        #     val = stack.pop()
        #     for num in range(nums[val]+1):
        #         res = num + val 
        #         if res == len(nums) - 1:
        #             return True 
        #         if res not in visited:
        #             stack.append(res)
        #             visited.add(res)
        # return False
                

  

            


        

18700