Mar 13

Author: siddydutta

2025-03-March-LeetCoding-Challenge/README.md

@@ -16,7 +16,7 @@
 | March 10 | [3306. Count of Substrings Containing Every Vowel and K Consonants II](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/) | Medium | Unsolved |
 | March 11 | [1358. Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | Medium | Solved |
 | March 12 | [2529. Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/) | Easy | Solved |
-| March 13 | []() |  |  |
+| March 13 | [](https://leetcode.com/problems/zero-array-transformation-ii/) | Medium | Unsolved |
 | March 14 | []() |  |  |
 | March 15 | []() |  |  |
 | March 16 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 7 | 4 | 3 |
+| Medium | 8 | 4 | 4 |
 | Hard   | 0 | 0 | 0 |

2025-03-March-LeetCoding-Challenge/Zero Array Transformation II.py

@@ -0,0 +1,29 @@
+class Solution:
+    def minZeroArray(self, nums: list[int], queries: list[list[int]]) -> int:
+        prefix_sum = [0] * (len(nums) + 1)
+        curr_sum, k = 0, 0
+        for i, num in enumerate(nums):
+            while curr_sum + prefix_sum[i] < num:
+                if k == len(queries):
+                    return -1
+                left, right, val = queries[k]
+                if i <= right:
+                    prefix_sum[max(i, left)] += val
+                    prefix_sum[right + 1] -= val
+                k += 1
+            curr_sum += prefix_sum[i]
+        return k
+
+
+def main():
+    nums = [2, 0, 2]
+    queries = [[0, 2, 1], [0, 2, 1], [1, 1, 3]]
+    assert Solution().minZeroArray(nums, queries) == 2
+
+    nums = [4, 3, 2, 1]
+    queries = [[1, 3, 2], [0, 2, 1]]
+    assert Solution().minZeroArray(nums, queries) == -1
+
+
+if __name__ == '__main__':
+    main()