Given an integer array nums, rotating the array by an integer k (where $0 \leq$ k $<$ nums.length) shifts each element to the left cyclically by k positions.

For any given rotation k, a score is calculated as the number of indices i where nums[i] $\leq$ i.

Return the rotation index k that yields the maximum possible score. If there are multiple values of k that achieve the maximum score, return the smallest such k.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $<$ nums.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.