Find the Longest Substring Containing Vowels in Even Counts
This is the Medium level question of Leetcode Link.
Problem Description
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 tim...
