Package g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts

Class Solution

java.lang.Object
g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts.Solution
public class Solution extends Object
1371 - Find the Longest Substring Containing Vowels in Even Counts.<p>Medium</p> <p>Given the string <code>s</code>, return the size of the longest substring containing each vowel an even number of times. That is, &lsquo;a&rsquo;, &lsquo;e&rsquo;, &lsquo;i&rsquo;, &lsquo;o&rsquo;, and &lsquo;u&rsquo; must appear an even number of times.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;eleetminicoworoep&rdquo;</p> <p><strong>Output:</strong> 13</p> <p><strong>Explanation:</strong> The longest substring is &ldquo;leetminicowor&rdquo; which contains two each of the vowels: <strong>e</strong> , <strong>i</strong> and <strong>o</strong> and zero of the vowels: <strong>a</strong> and <strong>u</strong>.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;leetcodeisgreat&rdquo;</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> The longest substring is &ldquo;leetc&rdquo; which contains two e&rsquo;s.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> s = &ldquo;bcbcbc&rdquo;</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong> In this case, the given string &ldquo;bcbcbc&rdquo; is the longest because all vowels: <strong>a</strong> , <strong>e</strong> , <strong>i</strong> , <strong>o</strong> and <strong>u</strong> appear zero times.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 5 x 10^5</code></li> <li><code>s</code> contains only lowercase English letters.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • findTheLongestSubstring

      public int findTheLongestSubstring(String s)