Minimum vertex cover
A bipartite graph has nL nodes on the left (0..nL-1) and nR nodes on the right (0..nR-1). edges is a list of [u, v] meaning left node u connects to right node v. Return the size of a minimum vertex cover: the fewest nodes (from either side) such that every edge has at least one endpoint chosen. Constraints: 1 <= nL, nR <= 200; edges may be empty or contain duplicates.
Implement
min_vertex_cover_bipartite(nL: int, nR: int, edges: list[list[int]]) → intExamples
in
[3,3,[[0,0],[0,1],[1,1],[2,2]]]out3What 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.
0:00 of about 35 min
solution.py
InputExpectedGot
[3,3,[[0,0],[0,1],[1,1],[2,2]]]3not run yetsample