fishercoder1534
diff --git a/‎paginated_contents/algorithms/4th_thousand/README.md
Copy file name to clipboardExpand all lines: paginated_contents/algorithms/4th_thousand/README.md
+1Lines changed: 1 addition & 0 deletions b/‎paginated_contents/algorithms/4th_thousand/README.md
Copy file name to clipboardExpand all lines: paginated_contents/algorithms/4th_thousand/README.md
+1Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/fourththousand/_3345.java
Copy file name to clipboard
+24Lines changed: 24 additions & 0 deletions b/‎src/main/java/com/fishercoder/solutions/fourththousand/_3345.java
Copy file name to clipboard
+24Lines changed: 24 additions & 0 deletions
diff --git a/‎src/test/java/com/fishercoder/fourththousand/_3345Test.java
Copy file name to clipboard
+21Lines changed: 21 additions & 0 deletions b/‎src/test/java/com/fishercoder/fourththousand/_3345Test.java
Copy file name to clipboard
+21Lines changed: 21 additions & 0 deletions
@@ -4,6 +4,7 @@
 | 3360 | [Stone Removal Game](https://leetcode.com/problems/stone-removal-game/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java) |                                                                               | Easy       |
 | 3354 | [Make Array Elements Equal to Zero](https://leetcode.com/problems/make-array-elements-equal-to-zero/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3354.java) |                                                                               | Easy       |
 | 3349 | [Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3349.java) |                                                                               | Easy       |
+| 3345 | [Smallest Divisible Digit Product I](https://leetcode.com/problems/smallest-divisible-digit-product-i/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3345.java) |                                                                               | Easy       |
 | 3340 | [Check Balanced String](https://leetcode.com/problems/check-balanced-string/)                                                        | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3340.java) |                                                                               | Easy       |
 | 3330 | [Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3330.java) |                                                                               | Easy       |
 | 3324 | [Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3324.java) |                                                                               | Easy       |
 
@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3345 {
+    public static class Solution1 {
+        public int smallestNumber(int n, int t) {
+            for (int num = n; ; num++) {
+                int digitSum = getDigitsProduct(num);
+                if (digitSum % t == 0) {
+                    return num;
+                }
+            }
+        }
+
+        private int getDigitsProduct(int num) {
+            int copy = num;
+            int product = 1;
+            while (copy != 0) {
+                product *= copy % 10;
+                copy /= 10;
+            }
+            return product;
+        }
+    }
+}
@@ -0,0 +1,21 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3345;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3345Test {
+    private _3345.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3345.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(10, solution1.smallestNumber(10, 2));
+    }
+}