May 20

Author: siddydutta

2025-05-May-LeetCoding-Challenge/README.md

@@ -23,7 +23,7 @@
 | May 17 | [75. Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | Solved |
 | May 18 | [1931. Painting a Grid With Three Different Colors](https://leetcode.com/problems/painting-a-grid-with-three-different-colors/) | Hard | Unsolved |
 | May 19 | [3024. Type of Triangle](https://leetcode.com/problems/type-of-triangle/) | Easy | Solved |
-| May 20 | []() |  |  |
+| May 20 | [3355. Zero Array Transformation I](https://leetcode.com/problems/zero-array-transformation-i/) | Medium | Solved |
 | May 21 | []() |  |  |
 | May 22 | []() |  |  |
 | May 23 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 9 | 7 | 2 |
+| Medium | 10 | 8 | 2 |
 | Hard   | 4 | 1 | 3 |

2025-05-May-LeetCoding-Challenge/Zero Array Transformation I.py

@@ -0,0 +1,25 @@
+from itertools import accumulate
+
+
+class Solution:
+    def isZeroArray(self, nums: list[int], queries: list[list[int]]) -> bool:
+        diff_array = [0] * (len(nums) + 1)
+        for start, finish in queries:
+            diff_array[start] += 1
+            diff_array[min(finish + 1, len(nums))] -= 1
+        prefix_sum = list(accumulate(diff_array))[:-1]
+        return all(num <= curr_sum for num, curr_sum in zip(nums, prefix_sum))
+
+
+def main():
+    nums = [1, 0, 1]
+    queries = [[0, 2]]
+    assert Solution().isZeroArray(nums, queries) is True
+
+    nums = [4, 3, 2, 1]
+    queries = [[1, 3], [0, 2]]
+    assert Solution().isZeroArray(nums, queries) is False
+
+
+if __name__ == '__main__':
+    main()