You are given a string s, which contains stars *.

In one operation, you can:

• Choose a star in s.

• Remove the closest non star character to its left, along with the star itself.

Return the string obtained after all stars have been removed.

Constraints:

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

• s consists of lowercase English letters and stars *.

• The operation above can be performed on s.

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.