# Number Of Valid Words For Each Puzzle: Practice Notes

Number Of Valid Words For Each Puzzle shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each puzzle is 7 letters; a word is valid if it contains the puzzle's first letter and every letter of the word is in the puzzle. Map each word to a bitmask (skip words with >7 distinct letters) and count frequencies of those masks. For a puzzle mask, iterate all submasks that include the first letter and sum frequencies.

## 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 * 2^{7} + words).

## Common mistake

Testing every word against every puzzle in O(W*P*L), or forgetting the first-letter requirement.

## 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 AI interview helper that uses your resume.