You are given an integer array nums. Your objective is to make all elements in nums equal by repeatedly applying a reduction operation.

In a single operation, perform the following sequence of actions:

• Find the maximum value in nums at index i. If multiple elements share the maximum value, choose any such index.

• Find the largest value in nums that is strictly smaller than the maximum value.

• Reduce nums[i] to this next largest value.

Return the total number of operations required to make all elements in nums equal.

Constraints:

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

• $1 \leq$ nums[i] $\leq 5 imes 10^4$

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.