Smallest Divisible Digit Product I

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. LeetCode Problem - 3345 class Solution { public int smallestNumber(int n, int t) { // Early ...