Recursive code for finding minimum number of jumps problem - c++

Question

I am trying to write a recursive code for the problem : Minimum number of jumps. Problem Link
This is the code that I have currently written. This code does not cover all the test cases. I wanted to know where I was going wrong with the code. I have made the recursive tree in my notebook for a sample array.
int solve(const int arr[], const int &n, int idx, int steps, bool &found){
if(arr[idx] == 0) return INT_MAX;
if(idx >= n - 1) {
found = true;
return steps;
}
int res = INT_MAX;
int lim = min(idx+arr[idx], n-1);
for(int i=1; i<=lim; i++) {
if(idx+i <= n) {
int ans = solve(arr, n, idx + i,steps + 1, found);
res = min(res, ans);
}
}
return res;
}
int minJumps(int arr[], int n){
bool found = false;
int res = solve(arr, n, 0, 0, found);
if(!found) return -1;
return res;
}
The code works for some cases like :
arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9};
but not for other arrays like:
arr[] = {1, 5, 4, 2, 0, 4, 0, 1, 1, 1, 3, 2, 1, 0, 3, 2, 1, 2, 0, 0, 1}
The expected output for this is -1, but my function returns 4.
I have spent over 4 hours trying to figure this out. I was thinking maybe some of you can help me.
I am NOT trying to get the solution to get accepted, I just want to first create a correct recursive code, which I can then memoize and then convert it to Dynamic Programming code.
UPDATE:
I may have fixed the code, can anyone please help me in verifying its correctness? I plan on converting this to DP code.
Here is the updated code:
int solve(const int arr[], const int &n, int idx, int steps){
if(idx <= n - 1 && arr[idx] == 0) return INT_MAX;
if(idx >= n - 1) return steps;
int res = INT_MAX;
for(int i=1; i<=arr[idx]; i++) {
if(idx+i <= n) {
int ans = solve(arr, n, idx + i,steps + 1);
res = min(res, ans);
}
}
return res;
}
int minJumps(int arr[], int n){
int res = solve(arr, n, 0, 0);
if(res == INT_MAX) return -1;
return res;
}