You are given an integer array nums of size n and a positive integer k.

Divide nums into $\frac{n}{3}$ arrays, each of size $3$, such that the difference between any two elements within the same array is at most k.

Return a $2$D array containing all the resulting arrays. If no valid division exists, return an empty array. If multiple valid configurations exist, return any of them.

Constraints:

• n $==$ nums.length

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

• n is a multiple of $3$

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

• $1 \leq$ k $\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.