Topological Sort Interview Patterns
6 min read What is Topological Sort? A topological ordering of a directed acyclic graph (DAG) is a linear ordering of vertices such […] Read article
Algorithms, Coding Interview Questions, Graphs
Algorithms, Coding Interview Questions, Depth-First Search, Graphs
Graph Traversal Interview Patterns
9 min read Graph Traversal Interview Patterns Graph problems appear in nearly every senior engineering interview. The key is recognizing which traversal fits Read article
Algorithms, Coding Interview Questions, Graphs, Shortest Path
Graph Shortest Path Interview Patterns
11 min read Shortest path problems appear in nearly every graph interview. The key skill is recognizing which algorithm applies to the given Read article
Graphs
Shortest Path in Weighted Graph: Bellman-Ford Algorithm
4 min read Bellman-Ford is the shortest-path algorithm you reach for when Dijkstra fails — specifically when graphs contain negative-weight edges or you Read article
Graphs
Minimum Spanning Tree: Prim’s and Kruskal’s Algorithms
3 min read Minimum Spanning Tree problems test whether you can connect all nodes in a weighted graph at minimum total cost — Read article
Graphs
Word Ladder: BFS on Implicit Graphs Explained
4 min read Word Ladder (LeetCode 127) is the canonical example of BFS on an implicit graph — the nodes are words, the Read article
Graphs
Clone a Graph: Deep Copy with DFS and BFS
2 min read Clone a Graph (LeetCode 133) is a foundational graph problem that tests your understanding of deep copy vs shallow copy, Read article
Graphs
Detect a Cycle in a Graph: Directed and Undirected
4 min read Cycle detection is asked in interviews at Google, Meta, Amazon, and anywhere that tests graphs. The classic application is deadlock Read article
Graphs
Number of Islands: Flood Fill Pattern Explained
4 min read Number of Islands (LeetCode 200) is the most common entry-level graph problem in technical interviews. It appears at Google, Amazon, Read article
Graphs
Topological Sort: Kahn’s Algorithm and DFS Approach
3 min read Topological sort is the graph algorithm you need for scheduling problems: course prerequisites, build systems, task dependencies, and package managers. Read article
Graphs
BFS vs DFS: When to Use Each with Examples
5 min read BFS and DFS are the two foundational graph traversal algorithms. Every other graph algorithm — Dijkstra, Bellman-Ford, topological sort, cycle Read article