3490. Count Beautiful Numbers

LeetCodeDynamic ProgrammingOpen on judge ↗

You are given two positive integers, l and r. A positive integer is called beautiful if the product of its digits is divisible by the sum of its digits. Return the count of beautiful numbers between l and r, inclusive. Example 1: Input: l = 10, r = 20 Output: 2 Explanation: The beautiful numbers in the range are 10 and 20. Example 2: Input: l = 1, r = 15 Output: 10 Explanation: The be

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI