You are given two arrays of integers, nums1 and nums2, where each element has a value between $1$ and $6$, inclusive.

In a single operation, you can select any element in either array and change its value to any integer between $1$ and $6$, inclusive.

Return the minimum number of operations needed to make the sum of elements in nums1 equal to the sum of elements in nums2. If it is impossible to make their sums equal, return $-1$.

Constraints:

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

• $1 \leq$ nums1[i], nums2[i] $\leq 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.