Search
⌘K

Leetcode 1839. Longest Substring Of All Vowels in Order

Find the length of the longest contiguous substring made only of vowels that contains each of 'a','e','i','o','u' at least once and whose characters never decrease alphabetically (all 'a's before 'e's before 'i's, etc.); return 0 if no such substring exists.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.