Given an integer array arr, find the minimum absolute difference between any two distinct elements. Return a list of all pairs of elements that have this minimum absolute difference.

Each pair must be returned as [x, y] where x < y. The returned list of pairs must be sorted in ascending order.

Constraints:

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

• $-10^6 \leq$ arr[i] $\leq 10^6$

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.