update

OneCodeMonkey · OneCodeMonkey · commit 25c672a63070 · 2025-08-02T23:23:58.000+08:00
diff --git a/codeForces/Codeforces_2093B_Expensive_Number.java b/codeForces/Codeforces_2093B_Expensive_Number.java
@@ -0,0 +1,31 @@
+// Time: 265 ms 
+// Memory: 1300 KB
+// Greedy.
+// T:O(n), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2093B_Expensive_Number {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            String n = sc.next();
+            int lastNonZeroIndex = -1, countPrefixNonZero = 0, countSuffix = 0;
+            for (int j = n.length() - 1; j >= 0; j--) {
+                if (n.charAt(j) != '0') {
+                    lastNonZeroIndex = j;
+                    break;
+                }
+                countSuffix++;
+            }
+            for (int j = 0; j < lastNonZeroIndex; j++) {
+                if (n.charAt(j) != '0') {
+                    countPrefixNonZero++;
+                }
+            }
+
+            System.out.println(countPrefixNonZero + countSuffix);
+        }
+    }
+}
diff --git a/leetcode_solved/leetcode_3622_Check_Divisibility_by_Digit_Sum_and_Product.java b/leetcode_solved/leetcode_3622_Check_Divisibility_by_Digit_Sum_and_Product.java
@@ -0,0 +1,21 @@
+// Runtime 0 ms Beats 100.00% 
+// Memory 41.34 MB Beats 100.00%
+// .
+// T:O(logn), S:O(1)
+// 
+class Solution {
+    public boolean checkDivisibility(int n) {
+        int sum1 = 0, sum2 = 1, n1 = n;
+        while (n1 > 0) {
+            sum1 += n1 % 10;
+            n1 /= 10;
+        }
+        n1 = n;
+        while (n1 > 0) {
+            sum2 *= n1 % 10;
+            n1 /= 10;
+        }
+
+        return n % (sum1 + sum2) == 0;
+    }
+}
