# Design Add And Search Words Data Structure: Study Guide

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

## Key idea

A Trie stores added words. search walks the Trie; a letter follows one child, while '.' branches to every child and succeeds if any branch matches the suffix. addWord is a standard Trie insert.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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(L) add, O(26^D * L) search in the worst wildcard case.

## Common mistake

Storing words in a hash set and scanning every word on each search, which is too slow when '.' is used often.

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