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
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
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
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
System Design
Design a Web Crawler
5 min read Design a web crawler that can index a significant portion of the internet. This question tests whether you understand distributed Read article