This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
The challenge Given a lowercase string of letters (no spaces, no digits), return the length of the longest substring made only of vowels ( aeiou ). Examples: solve ( 'codewarriors' ); // → 2 (the 'io' in warriors) solve ( 'suoidea' ); // → 3 (the 'uoi') solve ( 'aeioaexaeuoiou' ); // → 7 (the 'aeuoiou') solve ( 'bcd' ); // → 0 solve ( 'a' ); // → 1 The Codewars Kata in the JavaScript track uses…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.