Given a string s, rearrange the vowels in s such that they are sorted in descending order based on their frequencies in s. Place the sorted vowels back into their original positions while keeping all consonant characters unchanged.

If multiple vowels have the same frequency, preserve their relative order of first appearance in the original string.

The vowels are 'a', 'e', 'i', 'o', and 'u'.

Constraints:

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

• s consists 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.