Available question text
Find the smallest zero-free decimal string >= num whose digits' product is divisible by t. The core challenge is combining digit-DP/greedy with number-theoretic factorization of t (tracking required prime exponents contributed by digits 1–9) to efficiently search the minimal feasible number under large lengths and t up to 1e14.
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 3348. Smallest Divisible Digit Product II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source