Given a string s, rearrange the characters such that all vowels are sorted in nondecreasing order by their ASCII values, while all consonants remain in their original positions.

Return the resulting string.

Note: The vowels are 'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', and 'U'. All other English letters are considered consonants.

Constraints:

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

• s consists only of letters of the English alphabet in uppercase and lowercase.

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.