<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:
    def canJump(self, nums: List[int]) -> bool:
        if len(nums) == 1:
            return True
        
        dict = {0:[]}

        # Handle any case when the number is 0.
        for i in range(0, len(nums)):
            if nums[i] == 0:
                dict[0].append(i)
        
        if len(dict[0]) == 0:
            # print(f"Is this implying that if any element is 0 we fail? {dict}")
            return True
        
        if dict[0][-1] == len(nums) - 1:
            # print(f"What is this? {dict}")
            dict[0].pop()

        i = 0
        count = 0

        while i < len(nums):
            if count == len(dict[0]):
                return True
            
            if i >= dict[0][count]:
                return False
            
            if nums[i] > (dict[0][count] - i):
                count += 1
                i -= 1

            i += 1
        
        return False
17700