CodingHardcod-g244

Subject Max flowLevel Senior–Staff~40 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given an undirected graph with n nodes (0..n-1) and edges [u, v] (each edge has unit strength), find the minimum number of edges whose removal disconnects a given source node from a given sink node. If they are already disconnected, return 0. Parallel edges count separately. Constraints: 1 <= n <= 200.

Implement

min_edge_cut(n: int, edges: list[list[int]], source: int, sink: int) → int

Examples

in[3,[[0,1],[1,2]],0,2]out1

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.