Given an integer array nums and an integer pivot, rearrange nums such that the following conditions are satisfied:

• Every element less than pivot appears before every element greater than pivot.

• Every element equal to pivot appears in between the elements less than pivot and the elements greater than pivot.

• The relative order of elements smaller than pivot is preserved.

• The relative order of elements greater than pivot is preserved.

Return the rearranged array.

Constraints:

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

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

• pivot equals an element of nums.

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.