class Solution {
public:
int jump(int A[], int n) {
int count = 0;
if( n == 0 || n == 1 ) {
return 0;
}
for( int i = 0 ; i < n-1 ; ) {
count++;
int m = INT_MIN;
int mi = i;
int dest = i;
int jumpsize = A[i];
for( int j = 1; j <= jumpsize; j++ ) {
dest = i + j;
if( dest < n-1 && dest + A[dest] > m ) {
m = dest + A[dest];
mi = dest;
}
if( dest >= n-1 ) {
return count;
}
}
if( m == INT_MIN ) {
// Not possible
return -1;
}
else {
i = mi;
}
}
return count;
}
};
Arpit's Newsletter read by 15000+ engineers
🔥 Thrice a week, in your inbox, an essay about system design, distributed systems, microservices, programming languages internals, or a deep dive on some super-clever algorithm, or just a few tips on building highly scalable distributed systems.