Leetcode 3345. Smallest Divisible Digit Product I
Find the smallest integer >= n whose product of digits is divisible by t. With the given small bounds (n ≤ 100, t ≤ 10), this reduces to checking successive numbers and testing whether the product of their digits is divisible by t.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.