Given two integers lowLimit and highLimit, there are balls numbered from lowLimit to highLimit inclusive. There are also infinitely many numbered boxes.

Each ball is placed into the box whose number equals the sum of the digits of the ball’s number.

Return the maximum number of balls contained in any single box.

Constraints:

• $1 \le lowLimit \le {highLimit} \le 10^5$

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.