You are given an integer array nums.

You want to partition nums into contiguous subarrays by repeatedly selecting a non empty prefix from the remaining elements of nums, appending the MEX of the selected prefix to a result array, and removing that prefix from nums until nums becomes empty.

Return the lexicographically largest result array that can be formed.

Note: The MEX (minimum excluded value) of an array is the smallest non negative integer that does not appear in the array.

Constraints:

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

• $0 \leq$ nums[i] $\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.