# Word Search II Board: Walkthrough
Word Search II Board shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a trie of the words and DFS the board, walking the trie as you go. Prune dead trie nodes after a word is found to speed later searches.
## 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(mn * 4^L).
## Common mistake
Restarting a full word search for every word separately.
## 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 https://linkjob.ai.