You are given an integer n representing the total number of players indexed from $0$ to n $- 1$.

You are also given a $2$D integer array pick, where each pick[i] = [x_i, y_i] indicates that player x_i selected a ball of color y_i.

Player i wins the game if they collect strictly more than i balls of the same color (that is, at least i $+ 1$ balls sharing an identical color).

Return the total count of players who win the game.

Note: Multiple players can win the game, and each winning player is counted only once.

Constraints:

• $2 \leq$ n $\leq 10$

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

• pick[i].length $= 2$

• $0 \leq x_i \leq$ n $- 1$

• $0 \leq y_i \leq 10$

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.