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.

&nbsp;
Example 1:

Input: lowLimit = 1, highLimit = 10
Output: 2
Explanation:
Box Number:  1 2 3 4 5 6 7 8 9 10 11 ...
Ball Count:  2 1 1 1 1 1 1 1 1 0  0  ...
Box 1 has the most number of balls with 2 balls.

Example 2:

Input: lowLimit = 5, highLimit = 15
Output: 2
Explanation:
Box Number:  1 2 3 4 5 6 7 8 9 10 11 ...
Ball Count:  1 1 1 1 2 2 1 1 1 0  0  ...
Boxes 5 and 6 have the most number of balls with 2 balls in each.


Example 3:

Input: lowLimit = 19, highLimit = 28
Output: 2
Explanation:
Box Number:  1 2 3 4 5 6 7 8 9 10 11 12 ...
Ball Count:  0 1 1 1 1 1 1 1 1 2  0  0  ...
Box 10 has the most number of balls with 2 balls.


&nbsp;
Constraints:


	1 &lt;= lowLimit &lt;= highLimit &lt;= 105


class Solution:
    def countBalls(self, lowLimit: int, highLimit: int) -> int:
        boxes = [0] * 100
        
        for i in range(lowLimit, highLimit + 1):
			
			# For the current number "i", convert it into a list of its digits.
			# Compute its sum and increment the count in the frequency table.
			
            boxes[sum([int(j) for j in str(i)])] += 1
        
        return max(boxes)
class Solution {
    public int countBalls(int lowLimit, int highLimit) {
        Map<Integer,Integer> map = new HashMap<>();
        int count = Integer.MIN_VALUE;
        for(int i = lowLimit;i<=highLimit;i++){
            int value = 0;
            int temp = i;
            while (temp!=0){
                value += temp%10;
                temp/=10;
            }
            map.put(value,map.getOrDefault(value,0)+1);
            count = map.get(value) > count ? map.get(value) : count;
        }
        return count;
    }
}
class Solution {
public:
    int countBalls(int lowLimit, int highLimit) {

        vector<int> box (46,0);
        for(int i = lowLimit;i<=highLimit;i++)
        {
            int sum = 0;
            int temp = i;
            while(temp)
            {
                sum = sum + temp%10;
                temp = temp/10;
            }
            box[sum]++;
        }

        return *max_element(box.begin(),box.end());
    }
};
var countBalls = function(lowLimit, highLimit) {
    let obj={};
    for(let i=lowLimit; i<=highLimit; i++){
        i+=''; let sum=0;
        for(let j=0; j<i.length; j++){ sum+=i[j]*1; }
        obj[sum]?obj[sum]+=1:obj[sum]=1
    }
    return Math.max(...Object.values(obj));
};
Maximum Number of Balls in a Box