You are given an integer array nums consisting of $3 imes n$ elements.

You must remove exactly $n$ elements from nums, leaving $2 imes n$ elements. The remaining elements are partitioned into two equal parts:

• The first part contains the first $n$ elements.

• The second part contains the remaining $n$ elements.

The difference between the two parts is defined as the sum of the elements in the first part minus the sum of the elements in the second part.

Return the minimum possible difference after removing $n$ elements.

Constraints:

• nums.length $= 3 imes n$

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

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