# Design Add And Search Words: Interview Notes

Design Add And Search Words shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A trie whose search treats '.' as 'try every child'; DFS from the current node when a wildcard appears.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(L) exact, O(26^dots * L) with wildcards.

## Common mistake

Storing the words in a hash set and scanning all of them on every dotted query.

## 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 linkjob.ai.