https://www.interviewbit.com/problems/min-jumps-array/ Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. Example : Given array A = [2,3,1,1,4] Th…

InterviewBit :: Min Jumps Array.cpp

int Solution::jump(vector<int> &A) {
    
    int lastIndex = A.size()-1;
    int sz = A.size();
    int i = 0;
    
    int checkUpTo = i+A[i];
    int jumpCount = 1;
    
    while(i<=checkUpTo){
        int locMax = i + A[i];
        
        while(i<=checkUpTo){
            if(i>=lastIndex){
                return jumpCount;
            }
            locMax = max(locMax,i+A[i]);    
            i++;
        }
        
        jumpCount++;
        checkUpTo = locMax;
        if(locMax>=lastIndex){
            return jumpCount;
        }
    
    }
    
    return -1;
}