Greedy Algorithms

def can_jump(nums: list[int]) -> bool:
    farthest = 0
    
    for i, jump in enumerate(nums):
        # If current index is beyond the farthest reach, we cannot proceed
        if i > farthest:
            return False
        # Update maximum index we can reach
        farthest = max(farthest, i + jump)
        if farthest >= len(nums) - 1:
            return True
            
    return True