Available question text
Find the length of the longest substring where each vowel (a, e, i, o, u) occurs an even number of times. This is typically solved in O(n) by tracking the parity of the five vowels with a bitmask and remembering the earliest index each parity-state appeared to compute maximal substring lengths.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Amazon
Leetcode 1371. Find the Longest Substring Containing Vowels in Even Counts
Reported Jun 6, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 1371. Find the Longest Substring Containing Vowels in Even Counts
Reported Jun 6, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source