Mar 2

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Merge Two 2D Arrays by Summing Values.py

@@ -0,0 +1,32 @@
+class Solution:
+    def mergeArrays(self, nums1: list[list[int]], nums2: list[list[int]]) -> list[list[int]]:
+        result = []
+        ptr1, ptr2 = 0, 0
+        while ptr1 < len(nums1) and ptr2 < len(nums2):
+            if nums1[ptr1][0] == nums2[ptr2][0]:
+                result.append([nums1[ptr1][0], nums1[ptr1][1]+nums2[ptr2][1]])
+                ptr1 += 1
+                ptr2 += 1
+            elif nums1[ptr1][0] > nums2[ptr2][0]:
+                result.append(nums2[ptr2])
+                ptr2 += 1
+            else:
+                result.append(nums1[ptr1])
+                ptr1 += 1
+        result.extend(nums1[ptr1:])
+        result.extend(nums2[ptr2:])
+        return result
+
+
+def main():
+    nums1 = [[1, 2], [2, 3], [4, 5]]
+    nums2 = [[1, 4], [3, 2], [4, 1]]
+    assert Solution().mergeArrays(nums1, nums2) == [[1, 6], [2, 3], [3, 2], [4, 6]]
+
+    nums1 = [[2, 4], [3, 6], [5, 5]]
+    nums2 = [[1, 3], [4, 3]]
+    assert Solution().mergeArrays(nums1, nums2) == [[1, 3], [2, 4], [3, 6], [4, 3], [5, 5]]
+
+
+if __name__ == '__main__':
+    main()

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

@@ -5,7 +5,7 @@
 | Day | Problem | Level | Status |
 | --- | --- | --- | --- |
 | March 01 | [2460. Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array/) | Easy | Solved |
-| March 02 | []() |  |  |
+| March 02 | [2570. Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | Easy | Solved |
 | March 03 | []() |  |  |
 | March 04 | []() |  |  |
 | March 05 | []() |  |  |
@@ -40,6 +40,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 1 | 1 | 0 |
+| Easy   | 2 | 2 | 0 |
 | Medium | 0 | 0 | 0 |
 | Hard   | 0 | 0 | 0 |