You are given two integer arrays nums1 and nums2 of length n, alongside an integer k.

In a single operation, you can choose two indices i and j where $0 \leq$ i, j $<$ n, increment nums1[i] by k, and decrement nums1[j] by k.

Return the minimum number of operations needed to make nums1 identical to nums2. If it is impossible to make both arrays equal, return $-1$.

Note: Two arrays are considered equal if nums1[i] == nums2[i] for all $0 \leq$ i $<$ n.

Constraints:

• n $==$ nums1.length $==$ nums2.length

• $2 \leq$ n $\leq 10^5$

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

• $0 \leq$ k $\leq 10^5$

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.