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.

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3490. Count Beautiful Numbers

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact