786. Exploring Good Strings
0
Medium
A Good String is defined as a string that consists solely of vowels (a, e, i, o, u). Given a string S, determine the length of the longest substring of S that is also a Good String and output it as a positive integer N.
**Note**: The time limit for this problem is 1 second, so it is important to optimize the substring computation.
Input Format
A string 'S' representing the input string.
Output Format
A single positive integer N representing the length of the longest substring of S that is also a Good String.
Example
Input
cbaeicde
Output
3
Constraints
String length < 10^5
Loading...
View Submissions
Console