Given a string s, remove all trailing vowels from the string and return the resulting string.

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

Constraints:

• $1 \leq$ s.length $\leq 100$

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