Search
⌘K

Leetcode 1399. Count Largest Group

Group numbers 1..n by their digit-sum and count how many digit-sum groups achieve the maximum size. (Effectively compute digit-sum frequencies and return the number of sums with the highest frequency; n ≤ 10^4 so a simple counting map suffices.)


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.