You are given an integer array balls.

You want to distribute all the elements of balls into groups such that:

• Every element in the same group has identical values.

• The difference in size between any two groups is at most $1$. That is, there exists a positive integer $k$ such that each group contains either $k$ or $k + 1$ elements.

Return the minimum number of groups required to create a valid assignment.

Constraints:

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

• $1 \leq$ balls[i] $\leq 10^9$

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.