You are given a $0$ indexed array of positive integers nums and a positive integer limit.

In a single operation, you can swap the elements at any two indices i and j if $|$nums[i] $-$ nums[j]$| \leq$ limit.

Return the lexicographically smallest array that can be obtained by performing this operation any number of times.

Note: An array a is lexicographically smaller than an array b if in the first position where a and b differ, array a has an element that is strictly smaller than the corresponding element in b.

Constraints:

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

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

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