# Alien Dictionary: Interview Notes
Alien Dictionary shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a graph of letter-precedence from adjacent word pairs (the first differing character). Then Kahn topological sort; if a cycle remains or a prefix-invalid order appears (apple before app), the order is invalid and you return "".
## 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(C) over all characters.
## Common mistake
Comparing every pair of words instead of adjacent ones after sorting, or ignoring the "prefix comes first" invalid case.
## 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 AI interview assistant.