Can you reach the last position?

def can_reach_end(nums):
    leftmost = len(nums) - 1               # leftmost position known to reach the end
    for i in range(len(nums) - 2, -1, -1):
        if i + nums[i] >= leftmost:
            leftmost = i
    return leftmost == 0

#include <vector>

bool solve(const std::vector<int>& nums) {
    int leftmost = nums.size() - 1;
    for (int i = (int)nums.size() - 2; i >= 0; --i)
        if (i + nums[i] >= leftmost) leftmost = i;
    return leftmost == 0;
}

class Solution {
    public boolean canReachEnd(int[] nums) {
        int leftmost = nums.length - 1;
        for (int i = nums.length - 2; i >= 0; i--) if (i + nums[i] >= leftmost) leftmost = i;
        return leftmost == 0;
    }
}

function canReachEnd(nums) {
  let leftmost = nums.length - 1;
  for (let i = nums.length - 2; i >= 0; i--) if (i + nums[i] >= leftmost) leftmost = i;
  return leftmost === 0;
}

fn solve(nums: &[i64]) -> bool {
    let mut leftmost = nums.len() as i64 - 1;
    for i in (0..nums.len().saturating_sub(1)).rev() {
        if i as i64 + nums[i] >= leftmost {
            leftmost = i as i64;
        }
    }
    leftmost == 0
}

solve :: [Int] -> Bool
solve nums = foldr step (length nums - 1) (zip [0 ..] (init nums)) == 0
  where step (i, x) leftmost = if i + x >= leftmost then i else leftmost