CodingHardcod-g923

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

Question

There are n applicants and m jobs. You are given an adjacency list where allowed[i] is the list of job indices (0..m-1) applicant i can do. Each applicant can be assigned at most one job and each job to at most one applicant. Return the maximum number of applicants that can be assigned a job (the size of a maximum bipartite matching).

Implement

max_bipartite_matching(n: int, m: int, allowed: list[list[int]]) → int

Examples

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