# Word Search II: Explained

Word Search II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Insert every word into a trie, then DFS the board pruning with the trie; remove a found word from the trie so it is not reported twice.

## 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(mn * 4^L).

## Common mistake

Running a separate DFS per word instead of sharing prefixes.

## 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 here.