# Word Squares: Interview Notes

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

## Key idea

A word square has word[i][j] == word[j][i]. Build a prefix trie (or map prefix -> words). Backtrack row by row: the next word must start with the prefix formed by column i of the rows chosen so far.

## 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^{k} * k) pruned by the trie.

## Common mistake

Checking the square only after filling all k rows, which wastes work, or ignoring the prefix constraint on later rows.

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