A fancy string is defined as a string where no $3$ consecutive characters are identical.

Given a string s, delete the minimum number of characters from s to make it a fancy string.

Return the resulting string after performing the deletions. It can be shown that the final answer is always unique.

Constraints:

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

• s consists only of lowercase English letters.

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.