Introduction

In this blog post, we will explore how to solve the LeetCode problem "3345" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like Chatmagic, we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

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. 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 Explanation: The digit product of 16 is 6, which is divisible by 3, making it the smallest number greater than or equal to 15 that satisfies the condition. Constraints: 1 <= n <= 100 1 <= t <= 10

Explanation

Here's the solution:

• Iterate through numbers starting from n until a number is found whose digit product is divisible by t.
• For each number, calculate the product of its digits.

• Check if the digit product is divisible by t. If so, return the number.

• Time Complexity: O(N), where N is the number of iterations needed. In worst case, N can be up to 100, since n <= 100. Space Complexity: O(1)

Code

    def solve():
    n = int(input())
    t = int(input())

    def digit_product(num):
        product = 1
        s_num = str(num)
        for digit in s_num:
            product *= int(digit)
        return product

    i = n
    while True:
        product = digit_product(i)
        if product % t == 0:
            return i
        i += 1

print(solve())