Find The Longest Substring Containing Vowels In Even Counts

easy
Question Solve Solutions 
Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must appear an even number of times.

Input Format

String str

Output Format

Integer answer

Constraints

1 <= s.length <= 5 x 10^5
s contains only lowercase English letters.

Notice

NA

Example

Input
leetcodeisgreat
Output
5
Previous
Missing Element In Sorted Array
Next
Find Longest Awesome Substring

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list