Maximum Number of Balls in a Box
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.
Given two integers lowLimit and highLimit, return the number of balls in the box with the most balls.
Example 1
Input
lowLimit = 1, highLimit = 10Output
2Box 1 has the most number of balls with 2 balls.
Example 2
Input
lowLimit = 5, highLimit = 15Output
2Boxes 5 and 6 have the most number of balls with 2 balls in each.
Constraints
- 1 <= lowLimit <= highLimit <= 10^5
Asked at 3 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.