10-week-algorithm-excercise-master/Week_04/55/jump_game.py

from typing import List


class Solution:
    def canJump(self, nums: List[int]) -> bool:
        right_most = 0
        n = len(nums)
        for i in range(0, n):
            if i <= right_most:
                right_most = max(i + nums[i], right_most)
            if right_most >= n - 1:
                return True
        return False