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.