feat(leetcode): solve 4136 - Concatenate Non Zero Digits And Multiply By Sum Ii

Author: arnav-on-code

README.md

@@ -9,37 +9,37 @@ Automatically synchronize accepted LeetCode submissions to GitHub.
 ```text
 ████████████░░░░░░░░░░░░░░░░░░
 
-Solved: 126 / 300 Problems
+Solved: 127 / 300 Problems
 
 📊 Statistics
 Difficulty	Solved
 🟢 Easy	63
-🟡 Medium	57
+🟡 Medium	58
 🔴 Hard	6
-Total	126
+Total	127
 🔥 Latest Accepted Problem
 
 
 | Field | Value |
 |------|------|
-| Problem ID | 207 |
-| Title | Course Schedule |
+| Problem ID | 4136 |
+| Title | Concatenate Non Zero Digits And Multiply By Sum Ii |
 | Language | Python3 |
-| Runtime | 7 ms |
-| Memory | 21.7 MB |
+| Runtime | 361 ms |
+| Memory | 57.8 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 80
+- **Python3** : 81
 
 ## 📚 Recent Accepted Problems
 
+- 4136 Concatenate Non Zero Digits And Multiply By Sum Ii
 - 207 Course Schedule
 - 1036 Rotting Oranges
 - 695 Max Area Of Island
 - 417 Pacific Atlantic Water Flow
-- 207 Course Schedule
 
 
 ---
@@ -81,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-08 14:04:58
+2026-07-09 09:38:36

storage/solutions/4136_Concatenate_Non_Zero_Digits_And_Multiply_By_Sum_Ii/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2061160195",
+    "question_id": "4136",
+    "title_slug": "concatenate-non-zero-digits-and-multiply-by-sum-ii",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "361 ms",
+    "memory": "57.8 MB",
+    "status_code": 10,
+    "timestamp": 1783566675
+}

storage/solutions/4136_Concatenate_Non_Zero_Digits_And_Multiply_By_Sum_Ii/solution.py

@@ -0,0 +1,27 @@
+MOD, MAX = 1000000007, 100001
+pow = [1] * MAX
+for i in range(1, MAX):
+    pow[i] = (pow[i - 1] * 10) % MOD
+
+class Solution:
+    def sumAndMultiply(self, s: str, queries: list[list[int]]) -> list[int]:
+        n, res = len(s), []
+        A, B, Len = [[0] * (n + 1) for _ in range(3)]
+
+        for i in range(n):
+            d = int(s[i])
+            A[i + 1] = A[i] + d
+            B[i + 1] = (B[i] * 10 + d) % MOD if d else B[i]
+            Len[i + 1] = Len[i] + (d > 0)
+
+        res = []
+
+        for l, r in queries:
+            r += 1
+
+            sub = (B[l] * pow[Len[r] - Len[l]]) % MOD
+            x = (B[r] - sub) % MOD
+
+            res.append((x * (A[r] - A[l])) % MOD)
+
+        return res

storage/stats.json

@@ -1,12 +1,16 @@
 {
-    "total": 126,
+    "total": 127,
     "easy": 63,
-    "medium": 57,
+    "medium": 58,
     "hard": 6,
     "languages": {
-        "Python3": 80
+        "Python3": 81
     },
     "recent_problems": [
+        {
+            "id": "4136",
+            "title": "Concatenate Non Zero Digits And Multiply By Sum Ii"
+        },
         {
             "id": "207",
             "title": "Course Schedule"
@@ -22,18 +26,14 @@
         {
             "id": "417",
             "title": "Pacific Atlantic Water Flow"
-        },
-        {
-            "id": "207",
-            "title": "Course Schedule"
         }
     ],
     "last_problem": {
-        "id": "207",
-        "title": "Course Schedule",
+        "id": "4136",
+        "title": "Concatenate Non Zero Digits And Multiply By Sum Ii",
         "language": "Python3",
-        "runtime": "7 ms",
-        "memory": "21.7 MB"
+        "runtime": "361 ms",
+        "memory": "57.8 MB"
     },
-    "last_sync": "2026-07-08 14:04:58"
+    "last_sync": "2026-07-09 09:38:36"
 }