Leetcode 3348. Smallest Divisible Digit Product II

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3348. Smallest Divisible Digit Product II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact