Given an integer array nums sorted in nondecreasing order and an integer k, remove elements such that each distinct value appears at most k times while maintaining the original relative order.

Return the resulting array containing each element at most k times.

Note: The space used for returning or resizing the result does not count toward the auxiliary space complexity.

Constraints:

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

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

• nums is sorted in nondecreasing order.

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

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.