Given a string s containing characters of English words representing digits from $0$ to $9$ in an out of order format, return the reconstructed digits in ascending order as a string.

Constraints:

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

• s[i] is one of the characters ["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"].

• s is guaranteed to be valid.

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.