Skip to content

Practice Smallest Divisible Digit Product I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#3345
LeetCode Problem

Smallest Divisible Digit Product I

Problem Statement

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.

Source: Smallest Divisible Digit Product I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
n = 10, t = 2
Output
10

# Example 2

Input
n = 15, t = 3
Output
16

Constraints

1 <= n <= 100
1 <= t <= 10

Related LeetCode Problems

Practice more problems similar to Smallest Divisible Digit Product I.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.