# Alien Dictionary: Study Guide
Alien Dictionary shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a char graph from consecutive word pairs (first differing letter is an edge), then Kahn topo-sort; a cycle or an invalid prefix order means no answer.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, 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(C + W L).
## Common mistake
Comparing every letter of two words instead of stopping at the first difference, or accepting a longer word before its prefix.
## 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.