Jump Game

Given an positive integer N and a list of N integers A[]. Each element in the array denotes the maximum length of jump you can cover. Find out if you can make it to the last index if you start at the first index of the list.

• Time : O(n)
• Space : O(1)

class Solution {
public:
    int canReach(int A[], int N) {
        int res = 0;
        
        for(int i = 0; i < N and i <= res; i++) {
            res = max(res, i + A[i]);
        }
        
        return res >= N - 1;
    }
};