minimum_jumps.cpp

#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline istream &operator>>(istream &in, vector<T> &v) {
    for (T &x : v) {
        in >> x;
    }
    return in;
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &v) {
    if (v.empty())
        return out;
    for (size_t i = 0; i < v.size() - 1; i++) {
        out << v[i] << ' ';
    }
    out << v[v.size() - 1];
    return out;
}
class Solution {
  public:
    int minJumps(vector<int> &arr) {
        int n = arr.size();
        vector<int> helper(n, 0);
        for (int i = 0; i < n; i++) {
            cout<<helper<<endl;
            if (helper[min(arr[i] + i + 1, n)-1]!=0) {
                continue;
            }
            for (int j = i; j < min(arr[i] + i + 1, n); j++) {
                if (helper[j] == 0) {
                    helper[j] = helper[i] + 1;
                }
            }
            if (i + 1 < n and helper[i + 1] == 0) {
                break;
            }
        }
        cout<<helper<<endl;
        if (helper[n - 1] == 0) {
            return -1;
        }
        return helper[n - 1] - 1;
    }
};

signed main() {
    Solution s;
    vector<int> v{1, 2, 0, 0, 0};
    cout << s.minJumps(v);
    return 0;
}