Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3490. Count Beautiful Numbers
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.