Skip to content

Practice Minimum Equal Sum of Two Arrays After Replacing Zeros

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2918
LeetCode Problem

Minimum Equal Sum of Two Arrays After Replacing Zeros

Problem Statement

You are given two arrays nums1 and nums2 consisting of positive integers. You have to replace all the 0's in both arrays with strictly positive integers such that the sum of elements of both arrays becomes equal. Return the minimum equal sum you can obtain, or -1 if it is impossible.

Source: Minimum Equal Sum of Two Arrays After Replacing Zeros on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums1 = [3,2,0,1,0], nums2 = [6,5,0]
Output
12

# Example 2

Input
nums1 = [2,0,2,0], nums2 = [1,4]
Output
-1

Constraints

1 <= nums1.length, nums2.length <= 10^5
0 <= nums1[i], nums2[i] <= 10^6

Related LeetCode Problems

Practice more problems similar to Minimum Equal Sum of Two Arrays After Replacing Zeros.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.