You are given an integer array nums.

An index i is called dominant if there is at least $1$ element strictly to its right, and nums[i] is strictly greater than the average of all elements to its right.

Return the total number of dominant indices in nums.

Constraints:

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

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

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.