Before running any graph algorithm you have to store the graph in memory. An adjacency list stores only the edges that exist, so it fits sparse graphs like road maps. An adjacency matrix gives O(1) edge lookup but uses O(V²) space, so use it only for small or dense graphs. Most interview graphs are sparse, so the adjacency list is the default choice.