# Find Common Characters: Interview Notes

Find Common Characters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Given words, return the characters that appear in every word, with multiplicity (the min count of each letter across words). Start from the first word's counts and take element-wise minima with each later word; expand the letters by those minima.

## 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(total length).

## Common mistake

Using a set intersection, which drops multiplicity (two 'l's in 'bella','label','roller' should contribute one 'l' each? actually min('l') is 2,1,2 = 1 — sets would still work here, but 'cool','lock','cook' needs two 'o's vs one).

## 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 undetectable AI interview copilot.