Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3345. Smallest Divisible Digit Product I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source