# Find The Longest Substring Containing Vowels In Even Counts: Interview Notes

Find The Longest Substring Containing Vowels In Even Counts shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

XOR a 5-bit mask (one bit per vowel) as you scan. The longest substring with even vowel counts is the largest j-i where prefix_mask[j] == prefix_mask[i]. Store the first index of each of the 32 masks.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Tracking counts in a hashmap of 5-tuples without realizing the parity mask is enough, or resetting the mask at each consonant.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.