coding question

Problem Statement You are given a 0 -indexed array of integers A of length n. There is a frog initially positioned at index 0 . Each element A[i] represents the maximum distarce of a forward jump from index i. In other words, if the frog is at index i, it can jump to any index (i+j) where: (0jA[i]) as long as it does not go outside the array. However, the frog cannot jump the same distance twice in a row unless the value is 1 . This means that any consecutive jumps have to be different in value unless it is 1. Find the minimum number of jumps needed to reach the last index of A. Notes: - It is guaranteed that the answer always exists. Input Format The first line contains an integer, n, denoting the size of the given array A. Each line i of the n subsequent lines ( where 0i