Leetcode Problem 2918. Minimum Equal Sum of Two Arrays After Replacing Zeros

2918. Minimum Equal Sum of Two Arrays After Replacing Zeros

Leetcode Solutions

Initialize variables to store the sums (sum1, sum2) and zero counts (count1, count2) of both arrays.
Iterate through each array to calculate the sums and zero counts.
If both arrays have zeros, return the maximum of sum1 + count1 and sum2 + count2.
If only one array has zeros, check if the sum of the array without zeros is greater than or equal to the sum of the other array plus the number of zeros. If so, return the sum of the array without zeros.
If neither array has zeros and the sums are equal, return the sum.
If none of the above conditions are met, return -1 as it is impossible to make the sums equal.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen