3345. Smallest Divisible Digit Product I

LeetCodeMathEnumerationOpen on judge ↗

You are given two integers n and t. Return the smallest number greater than or equal to n such that the product of its digits is divisible by t. Example 1: Input: n = 10, t = 2 Output: 10 Explanation: The digit product of 10 is 0, which is divisible by 2, making it the smallest number greater than or equal to 10 that satisfies the condition. Example 2: Input: n = 15, t = 3 Output: 16 Ex

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI