Loading…
Maximum Flow (Edmonds-Karp) is a hard coding interview question covering graphs, breadth-first search — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Implement the Edmonds-Karp algorithm (BFS-based Ford-Fulkerson) for maximum flow.
Given a directed graph with edge capacities, source s, and sink t, find the maximum flow from s to t.
Example: 4 nodes, edges 0->1 cap=10, 0->2 cap=10, 1->3 cap=10, 2->3 cap=10 -> max flow = 20
Used in network routing, bipartite matching, and project selection problems.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.