CodingMediumcod-g738

Subject BipartiteLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You must split n people (0..n-1) into exactly two teams. You are given a list of `conflicts` `[a, b]` meaning a and b cannot be on the same team. Return true if a valid assignment into two teams exists such that no conflicting pair shares a team, false otherwise. The conflict graph may be disconnected.

Implement

can_split_teams(n: int, conflicts: list[list[int]]) → bool

Examples

in[4,[[0,1],[1,2],[2,3],[3,0]]]outtrue

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.