Given an integer n, each integer from $1$ to n is partitioned into groups based on the sum of its digits.

Return the number of groups that have the maximum size.

Constraints:

• $1 \leq$ n $\leq 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.