Maximum Number of Balls in a Box Problem

Maximum Number of Balls in a Box Problem — ExecCode Easy DSA Practice

Solve the Maximum Number of Balls in a Box problem on ExecCode. Free online easy DSA practice in Hashing. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given two integers lowLimit and highLimit, return the number of balls in the box with the most balls. Your task is to you are working in a ball factory where you have n balls numbered from lowLimit up to highLimit inclusive (i.e., n == highLimit - lowLimit + 1), and an infinite number of boxes numbered from 1 to infinity. Your job at this factory is to put each ball in the box with a number equal to the sum of digits of the ball's number. For example, the ball number 321 will be put in the box number 3 + 2 + 1 = 6 and the ball number 10 will be put in the box number 1 + 0 = 1. Return the required answer exactly as shown in the examples.

Examples

Input {"lowLimit": 1, "highLimit": 10}; Output 2. Input {"lowLimit": 5, "highLimit": 15}; Output 2

Constraints

1 <= lowLimit <= highLimit <= 10^5

Practice Maximum Number of Balls in a Box free on ExecCode. Browse DSA problems, topic map, and placement guides.