find-the-longest-substring-containing-vowels-in-even-counts

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the string <code>s</code>, return the size of the longest substring containing each vowel an even number of times. That is, &#39;a&#39;, &#39;e&#39;, &#39;i&#39;, &#39;o&#39;, and &#39;u&#39; must appear an even number of times.

&nbsp;
Example 1:

<pre>
Input: s = &quot;eleetminicoworoep&quot;
Output: 13
Explanation: The longest substring is &quot;leetminicowor&quot; which contains two each of the vowels: e, i and o and zero of the vowels: a and u.
</pre>

Example 2:

<pre>
Input: s = &quot;leetcodeisgreat&quot;
Output: 5
Explanation: The longest substring is &quot;leetc&quot; which contains two e&#39;s.
</pre>

Example 3:

<pre>
Input: s = &quot;bcbcbc&quot;
Output: 6
Explanation: In this case, the given string &quot;bcbcbc&quot; is the longest because all vowels: a, e, i, o and u appear zero times.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 5 x 10^5</code></li>
	<li><code>s</code>&nbsp;contains only lowercase English letters.</li>
</ul>

findTheLongestSubstring

Find the Longest Substring Containing Vowels in Even Counts

Bit Manipulation

Hash Table

String

Prefix Sum

给你一个字符串&nbsp;<code>s</code>&nbsp;，请你返回满足以下条件的最长子字符串的长度：每个元音字母，即&nbsp;&#39;a&#39;，&#39;e&#39;，&#39;i&#39;，&#39;o&#39;，&#39;u&#39; ，在子字符串中都恰好出现了偶数次。

&nbsp;

示例 1：

<pre>
输入：s = &quot;eleetminicoworoep&quot;
输出：13
解释：最长子字符串是 &quot;leetminicowor&quot; ，它包含 e，i，o&nbsp;各 2 个，以及 0 个 a，u 。
</pre>

示例 2：

<pre>
输入：s = &quot;leetcodeisgreat&quot;
输出：5
解释：最长子字符串是 &quot;leetc&quot; ，其中包含 2 个 e 。
</pre>

示例 3：

<pre>
输入：s = &quot;bcbcbc&quot;
输出：6
解释：这个示例中，字符串 &quot;bcbcbc&quot; 本身就是最长的，因为所有的元音 a，e，i，o，u 都出现了 0 次。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 5 x 10^5</code></li>
	<li><code>s</code>&nbsp;只包含小写英文字母。</li>
</ul>