Longest vowel stretch
Given a lowercase string, return the length of the longest contiguous stretch made up entirely of vowels ('a', 'e', 'i', 'o', 'u'). Return 0 if the string contains no vowels. For example, 'queueing' contains the stretch 'ueuei' of length 5, and 'rhythm' returns 0.
Implement
longest_vowel_run(s: str) → intExamples
in
["queueing"]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 11 min
solution.py
InputExpectedGot
["queueing"]5not run yetsample