How do you reconstruct the alien alphabet order from a list of sorted foreign words?
PICTURE THIS: 1, 2, 2, 8
Simple meaning
Compare adjacent words to extract letter-precedence edges, then topological sort.
WHY — Graphs instead of guessing?
Why interviewers care about Graphs:
question about Graphs.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Compare adjacent words to
extract letter-precedence edges, then topological sort.
- 2Inconsistent prefixes (longer word
before its prefix) or a cycle mean invalid order.
- 3Time is O(total characters
+ alphabet^2) in the worst case.
- 4Any valid topo order
is accepted unless they ask for smallest lexicographic, which needs a min-heap Kahn.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Compare adjacent words to extract letter-precedence edges, then topological sort. Inconsistent prefixes (longer word before its prefix) or a cycle mean invalid order.