You are given an integer array nums.

The low score of nums is the minimum absolute difference between any two elements at distinct indices, defined as $\min |$ nums[i] $-$ nums[j] $|$ where $0 \leq i < j <$ nums.length.

The high score of nums is the maximum absolute difference between any two elements at distinct indices, defined as $\max |$ nums[i] $-$ nums[j] $|$ where $0 \leq i < j <$ nums.length.

The total score of nums is the sum of its high score and low score.

Return the minimum possible total score of nums after modifying the values of at most $2$ elements.

Constraints:

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

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

Input: nums = [2, 9, 14]-List[int]
Output: 0-int
Explanation: By changing two elements to match the remaining value, all elements can be made equal, resulting in both the high score and low score being 0.

Input: nums = [6, 6, 12, 20]-List[int]
Output: 0-int
Explanation: By changing 12 and 20 to 6, all elements become equal, so the total score is 0.

Input: nums = [100, 101, 250, 400, 401, 900]-List[int]
Output: 300-int
Explanation: After changing 401 and 900 to 100, the remaining range is from 100 to 400, giving a high score of 300 and a low score of 0.

Input: nums = [2, 999999999, 500000000, 500000001, 750000000]-List[int]
Output: 250000000-int
Explanation: After changing 2 and 999999999 to values near 500000000, the remaining maximum difference is 750000000 minus 500000000, or 250000000, while the low score can be 0.

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.