Available question text
Count the integers in [l, r] whose digits' product is divisible by their digits' sum — a combinatorial digit-DP problem where you enumerate/track digit sums (up to 9*number_of_digits) and maintain product modulo the current sum to test divisibility.
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 3490. Count Beautiful Numbers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source