An unknown array of integers arr containing $n$ elements was used to construct a new array nums. A positive integer $k$ ($k > 0$) was chosen, and two arrays were formed:

• lower, where lower[i] $=$ arr[i] $- k$ for each index $i$

• higher, where higher[i] $=$ arr[i] $+ k$ for each index $i$

The elements of lower and higher were then combined in an arbitrary order to form the array nums of length $2 \times n$.

Given the array nums, reconstruct and return the original array arr. If there are multiple valid answers, return any of them.

Note: The integer $k$ must be strictly positive ($k > 0$).

Constraints:

• $2 \times n =$ nums.length

• $1 \leq n \leq 1000$

• $1 \leq$ nums[i] $\leq 10^9$

• The test cases are generated such that there exists at least one valid array arr.

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.