// TOPIC
#traversal
3 articles
◆◆IntermediateGoogleMeta
01Graphs
Learn the graph data structure: adjacency lists vs matrices, BFS and DFS traversal, and the grid-as-graph reframe that cracks whole problem categories.
#graphs#data-structures#bfs
12 min◆◆IntermediateAmazonGoogle
02DFS Patterns
Depth-first search is the backbone of cycle detection, flood fill, path enumeration, and clone graph — master the visited-set template, the 3-color trick, and when to reach for DFS over BFS.
#graphs#dfs#traversal
14 min◆◆IntermediateAmazonGoogle
03BFS Patterns
Queue-driven level-by-level traversal and why breadth-first search is the only guaranteed way to find shortest paths in unweighted graphs. Templates, traps, and four worked problems.
#graphs#bfs#traversal
13 min