CodingMediumcod-g707

Subject Max flowLevel Mid–Senior~30 minCommon in Algorithms & data structures interviewsIndustries Software development, Telecom

Question

A directed network on n nodes (0..n-1) is given by a list of directed links [u, v] (each carries one unit). Return the maximum number of edge-disjoint directed paths from s to t (paths that share no link). Parallel links between the same pair each count separately. Constraints: 1 <= n <= 500.

Implement

max_edge_disjoint_paths(n: int, edges: list[list[int]], s: int, t: int) → int

Examples

in[4,[[0,1],[0,2],[1,3],[2,3],[1,2]],0,3]out2

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.