CodingHardcod-g893

Subject Bipartite matchingLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You are given a bipartite graph with nL left nodes and nR right nodes and edges [a, b]. Return the size of a maximum independent set: the largest set of nodes such that no edge connects two chosen nodes. Constraints: 1 <= nL, nR <= 60.

Implement

max_independent_set(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.