Given an integer array nums, choose $4$ distinct indices w, x, y, and z such that the product difference between pair (nums[w], nums[x]) and pair (nums[y], nums[z]) is maximized.

The product difference between two pairs $(a, b)$ and $(c, d)$ is defined as $(a \cdot b) - (c \cdot d)$.

Return the maximum possible product difference.

Constraints:

• $4 \leq$ nums.length $\leq 10^4$

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

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.