Given an integer array nums and an integer k, return the most competitive subsequence of nums of size k.

A subsequence a of length k is considered more competitive than another subsequence b of length k if, at the first position where a and b differ, the value in a is strictly smaller than the value in b.

Constraints:

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

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

• $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.