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.