May 22

Author: siddydutta

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

@@ -25,7 +25,7 @@
 | May 19 | [3024. Type of Triangle](https://leetcode.com/problems/type-of-triangle/) | Easy | Solved |
 | May 20 | [3355. Zero Array Transformation I](https://leetcode.com/problems/zero-array-transformation-i/) | Medium | Solved |
 | May 21 | [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | Medium | Solved |
-| May 22 | []() |  |  |
+| May 22 | [3362. Zero Array Transformation III](https://leetcode.com/problems/zero-array-transformation-iii/) | Medium | Unsolved |
 | May 23 | []() |  |  |
 | May 24 | []() |  |  |
 | May 25 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 11 | 9 | 2 |
+| Medium | 12 | 9 | 3 |
 | Hard   | 4 | 1 | 3 |

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

@@ -0,0 +1,38 @@
+from heapq import heappop, heappush
+
+
+class Solution:
+    def maxRemoval(self, nums: list[int], queries: list[list[int]]) -> int:
+        queries.sort()  # queries.sort(lambda q: q[0])
+        available, assigned = [], []
+        count, ptr = 0, 0
+        for time in range(len(nums)):
+            while assigned and assigned[0] < time:
+                heappop(assigned)
+            while ptr < len(queries) and queries[ptr][0] <= time:
+                heappush(available, -queries[ptr][1])
+                ptr += 1
+            while len(assigned) < nums[time] and available and -available[0] >= time:
+                heappush(assigned, -heappop(available))
+                count += 1
+            if len(assigned) < nums[time]:
+                return -1
+        return len(queries) - count
+
+
+def main():
+    nums = [2, 0, 2]
+    queries = [[0, 2], [0, 2], [1, 1]]
+    assert Solution().maxRemoval(nums, queries) == 1
+
+    nums = [1, 1, 1, 1]
+    queries = [[1, 3], [0, 2], [1, 3], [1, 2]]
+    assert Solution().maxRemoval(nums, queries) == 2
+
+    nums = [1, 2, 3, 4]
+    queries = [[0, 3]]
+    assert Solution().maxRemoval(nums, queries) == -1
+
+
+if __name__ == '__main__':
+    main()