CodingHardcod-g460

Subject Bipartite matchingLevel Senior–Staff~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 a list of edges [l, r], return the size of the minimum vertex cover: the fewest vertices (from either side) that touch every edge. Use Konig's theorem (in a bipartite graph the minimum vertex cover size equals the maximum matching size). Assume 1 <= nL, nR <= 500.

Implement

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

Examples

in[2,2,[[0,0],[0,1],[1,1]]]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.