You are given an array nums consisting of distinct positive integers.

In one right shift operation, the last element of nums is moved to the first position, and all other elements are shifted one position to the right.

Return the minimum number of right shifts needed to sort nums in strictly increasing order. If it is impossible to sort the array using right shifts, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

• nums contains distinct integers.

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.