You are given two integer arrays nums1 and nums2.

From nums1, exactly $2$ elements are removed, and a single integer x is added to every remaining element. After these operations, the modified nums1 becomes equal to nums2, meaning both arrays contain the same values with identical frequencies.

Return the minimum possible integer x that satisfies this condition.

Constraints:

• $3 \leq$ nums1.length $\leq 200$

• nums2.length $==$ nums1.length $- 2$

• $0 \leq$ nums1[i], nums2[i] $\leq 1000$

• The test cases are generated such that at least one integer x exists that allows nums1 to become equal to nums2 after removing $2$ elements and adding x to each remaining element.

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.