Non-empty array

solution.java

import java.util.HashSet;

class Solution {
    public int solution(int[] A) {
        int currentPosition = 0;
        int jumps = 0;
        HashSet<Integer> visited = new HashSet<>();

        while (currentPosition >= 0 && currentPosition < A.length) {
            if (visited.contains(currentPosition)) {
                return -1; // Pawn entered a cycle
            }
            visited.add(currentPosition);
            currentPosition += A[currentPosition];
            jumps++;
        }

        return jumps;
    }
}