diff --git a/medium/minmum_eqaul_sum_of_two_arrays_after_replacing_zeros.py b/medium/minmum_eqaul_sum_of_two_arrays_after_replacing_zeros.py
new file mode 100644
index 0000000..5df2548
--- /dev/null
+++ b/medium/minmum_eqaul_sum_of_two_arrays_after_replacing_zeros.py
@@ -0,0 +1,26 @@
+# https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros
+
+from typing import List
+
+class Solution:
+    def minSum(self, nums1: List[int], nums2: List[int]) -> int:
+        zeros_1 = 0
+        sum_1 = 0
+        zeros_2 = 0
+        sum_2 = 0
+        for num in nums1:
+            sum_1 += num
+            if num == 0:
+                zeros_1 += 1
+                sum_1 += 1
+        for num in nums2:
+            sum_2 += num
+            if num == 0:
+                zeros_2 += 1
+                sum_2 += 1
+        if zeros_1 == 0 and sum_1 < sum_2:
+            return -1
+        elif zeros_2 == 0 and sum_1 > sum_2:
+            return -1
+        return max(sum_1, sum_2)
+