You are given an integer array nums.

You repeatedly perform the following operation until nums becomes empty:

1. Identify all distinct elements present in nums.

2. Append these distinct elements in ascending order to an array ans.

3. Remove one occurrence of each of these identified elements from nums.

Return the resulting array ans.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

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.