Available question text
Find the smallest integer > n such that for every digit d in the number, digit d appears exactly d times. The core challenge is generating/validating the constrained set of possible digit-count combinations (which is small due to the digit-count rules and n ≤ 10^6) and selecting the minimal candidate greater than n.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2048. Next Greater Numerically Balanced Number
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source