CodingMediumcod-g470

Subject Bipartite matchingLevel Mid–Senior~30 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a bipartite graph with nL left nodes (0..nL-1), nR right nodes (0..nR-1), and edges [l, r], return the size of the maximum matching: the largest set of edges with no two sharing an endpoint. Use Kuhn's augmenting-path algorithm. Assume 1 <= nL, nR <= 500.

Implement

max_bipartite_matching(nL: int, nR: int, edges: list[list[int]]) → int

Examples

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

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.