You are given two arrays nums1 and nums2 consisting of integers greater than or equal to $0$.

You must replace every $0$ in both arrays with a strictly positive integer such that the sum of the elements in nums1 becomes equal to the sum of the elements in nums2.

Return the minimum equal sum that can be achieved, or $-1$ if it is impossible to make the sums equal.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 10^5$

• $0 \leq$ nums1[i], nums2[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.