How do you represent a graph with an adjacency list versus an adjacency matrix?
PICTURE THIS: FLEX VS GRID
Simple meaning
An adjacency list stores neighbors per vertex: O(V+E) space and fast iteration over edges, best for sparse graphs.
WHY — Graphs instead of guessing?
Why interviewers care about Graphs:
contrast on Graphs, not two memorised paragraphs.
the developer, then one case where picking wrong hurts.
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:
- 1An adjacency list stores
neighbors per vertex: O(V+E) space and fast iteration over edges, best for sparse graphs.
- 2A matrix is a
V by V boolean or weight grid: O(1) edge lookup but O(V^2) space, better when the graph is dense.
- 3Interview coding almost always
uses lists.
- 4Give an example
One tiny concrete case you can say aloud.
- 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
An adjacency list stores neighbors per vertex: O(V+E) space and fast iteration over edges, best for sparse graphs. A matrix is a V by V boolean or weight grid: O(1) edge lookup but O(V^2) space, better when the graph is dense.