May 10

Author: siddydutta

2025-05-May-LeetCoding-Challenge/Minimum Equal Sum of Two Arrays After Replacing Zeros.py

@@ -0,0 +1,30 @@
+class Solution:
+    def __sum_and_zeros(self, nums: list[int]) -> tuple[int, int]:
+        sum_, count = 0, 0
+        for num in nums:
+            sum_ += num
+            count += num == 0
+        return sum_, count
+
+    def minSum(self, nums1: list[int], nums2: list[int]) -> int:
+        (s1, z1), (s2, z2) = map(self.__sum_and_zeros, (nums1, nums2))
+        min_sum1, min_sum2 = s1 + z1, s2 + z2
+        if z1 == 0 and s1 < min_sum2:
+            return -1
+        if z2 == 0 and s2 < min_sum1:
+            return -1
+        return max(min_sum1, min_sum2)
+
+
+def main():
+    nums1 = [3, 2, 0, 1, 0]
+    nums2 = [6, 5, 0]
+    assert Solution().minSum(nums1, nums2) == 12
+
+    nums1 = [2, 0, 2, 0]
+    nums2 = [1, 4]
+    assert Solution().minSum(nums1, nums2) == -1
+
+
+if __name__ == '__main__':
+    main()

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

@@ -13,7 +13,7 @@
 | May 07 | [3341. Find Minimum Time to Reach Last Room I](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-i/) | Medium | Solved |
 | May 08 | [3342. Find Minimum Time to Reach Last Room II](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/) | Medium | Solved |
 | May 09 | [3343. Count Number of Balanced Permutations](https://leetcode.com/problems/count-number-of-balanced-permutations/) | Hard | Unsolved |
-| May 10 | []() |  |  |
+| May 10 | [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/) | Medium | Solved |
 | May 11 | []() |  |  |
 | May 12 | []() |  |  |
 | May 13 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 2 | 2 | 0 |
-| Medium | 5 | 5 | 0 |
+| Medium | 6 | 6 | 0 |
 | Hard   | 2 | 1 | 1 |