Shortest Path in Weighted Graph: Bellman-Ford Algorithm
Bellman-Ford is the shortest-path algorithm you reach for when Dijkstra fails — specifically when graphs contain negative-weight edges or you […]
Graphs
Graphs
Graphs
Minimum Spanning Tree: Prim’s and Kruskal’s Algorithms
Minimum Spanning Tree problems test whether you can connect all nodes in a weighted graph at minimum total cost —
Graphs
Word Ladder: BFS on Implicit Graphs Explained
Word Ladder (LeetCode 127) is the canonical example of BFS on an implicit graph — the nodes are words, the
Graphs
Clone a Graph: Deep Copy with DFS and BFS
Clone a Graph (LeetCode 133) is a foundational graph problem that tests your understanding of deep copy vs shallow copy,
Graphs
Detect a Cycle in a Graph: Directed and Undirected
Cycle detection is asked in interviews at Google, Meta, Amazon, and anywhere that tests graphs. The classic application is deadlock
Graphs
Number of Islands: Flood Fill Pattern Explained
Number of Islands (LeetCode 200) is the most common entry-level graph problem in technical interviews. It appears at Google, Amazon,
Graphs
Topological Sort: Kahn’s Algorithm and DFS Approach
Topological sort is the graph algorithm you need for scheduling problems: course prerequisites, build systems, task dependencies, and package managers.
Graphs
BFS vs DFS: When to Use Each with Examples
BFS and DFS are the two foundational graph traversal algorithms. Every other graph algorithm — Dijkstra, Bellman-Ford, topological sort, cycle