You are given a string s consisting of lowercase English letters.

You can delete any number of duplicate characters from s such that each distinct character present in the original string remains at least once in the resulting string.

Return the lexicographically smallest string that can be formed after performing these deletions.

Constraints:

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

• s consists of lowercase English letters only.

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.