Updated 3345, 3346

Author: javadev

src/main/java/g3301_3400/s3345_smallest_divisible_digit_product_i/Solution.java

@@ -1,23 +1,27 @@
 package g3301_3400.s3345_smallest_divisible_digit_product_i;
 
-// #Easy #2024_11_12_Time_1_ms_(59.15%)_Space_40.5_MB_(98.74%)
+// #Easy #Math #Enumeration #2024_11_13_Time_0_ms_(100.00%)_Space_41.2_MB_(29.77%)
 
 public class Solution {
     public int smallestNumber(int n, int t) {
-        for (int i = n; i < 101; i++) {
-            if (digProduct(i) % t == 0) {
-                return i;
+        int num = -1;
+        int check = n;
+        while (num == -1) {
+            int product = findProduct(check);
+            if (product % t == 0) {
+                num = check;
             }
+            check += 1;
         }
-        return -1;
+        return num;
     }
 
-    private int digProduct(int n) {
-        int pro = 1;
-        while (n > 0) {
-            pro *= n % 10;
-            n /= 10;
+    private int findProduct(int check) {
+        int res = 1;
+        while (check > 0) {
+            res *= check % 10;
+            check = check / 10;
         }
-        return pro;
+        return res;
     }
 }

src/main/java/g3301_3400/s3346_maximum_frequency_of_an_element_after_performing_operations_i/Solution.java

@@ -1,6 +1,7 @@
 package g3301_3400.s3346_maximum_frequency_of_an_element_after_performing_operations_i;
 
-// #Medium #2024_11_12_Time_7_ms_(96.72%)_Space_57.4_MB_(44.86%)
+// #Medium #Array #Sorting #Binary_Search #Prefix_Sum #Sliding_Window
+// #2024_11_13_Time_7_ms_(96.84%)_Space_56.4_MB_(92.35%)
 
 public class Solution {
     private int getMax(int[] nums) {