You are given an integer array nums.

You must partition nums into two arrays, nums1 and nums2, such that:

• Each element of nums belongs to either nums1 or nums2.

• Both nums1 and nums2 are not empty.

• The value of the partition is defined as $| \max($nums1$) - \min($nums2$) |$.

Return the minimum possible value of the partition among all possible configurations.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

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

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.