Maximum bipartite matching
There are nL applicants (0..nL-1) and nR jobs (0..nR-1). Each edge [a, j] means applicant a is qualified for job j. Each applicant takes at most one job and each job is filled by at most one applicant. Return the maximum number of jobs that can be filled (the size of a maximum bipartite matching). Constraints: 1 <= nL, nR <= 60.
Implement
max_matching(nL: int, nR: int, edges: list[list[int]]) → intExamples
in
[3,3,[[0,0],[0,1],[1,0],[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 30 min
solution.py
InputExpectedGot
[3,3,[[0,0],[0,1],[1,0],[2,2]]]3not run yetsample