A string is considered beautiful if it meets the following conditions:

• It contains every one of the $5$ English vowels ('a', 'e', 'i', 'o', and 'u') at least once.

• Its characters are arranged in nondecreasing alphabetical order (that is, every 'a' occurs before any 'e', every 'e' occurs before any 'i', every 'i' occurs before any 'o', and every 'o' occurs before any 'u').

Given a string word consisting of English vowels, return the length of the longest beautiful substring in word. If no beautiful substring is present, return $0$.

A substring is a contiguous sequence of characters within a string.

Constraints:

• $1 \leq$ word.length $\leq 5 \times 10^5$

• word consists of characters 'a', 'e', 'i', 'o', and 'u'.

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.