I am not sure how to code this homework problem in java

Write a function: class Solution f public int solution(int[] A); that, given a non-empty zero-indexed array A consisting of N integers, returns the number of jumps after which the pawn will be out of the array. The function should return -1 if the pawn will never jump out of the array. For example, for the array A given above, the function should return 4, as explained above. Given array A such that: the function should return 1