You are given two integer arrays nums1 and nums2 of equal length.

Every element in nums1 is increased by an integer x such that nums1 becomes equal to nums2, meaning both arrays contain the exact same elements after sorting.

Return the integer x.

Constraints:

• $1 \leq$ nums1.length $=$ nums2.length $\leq 100$

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

• The test cases are generated such that there exists an integer x where nums1 can become equal to nums2 after adding x to each element of nums1.

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.