dsa9 min read
Network Flow Concepts — Max Flow, Min Cut, and Edmonds-Karp [Ford-Fulkerson, Google, Amazon]
A complete walkthrough of network flow for FAANG interviews: the max-flow min-cut theorem, Ford-Fulkerson, Edmonds-Karp BFS-augmenting paths, residual graphs, and practical applications including bipartite matching and project selection. Asked at Google, Amazon, and Meta as a senior-level systems-design-meets-algorithms screen.
Read →