Two-team conflict resolution
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]]) → boolExamples
in
[4,[[0,1],[1,2],[2,3],[3,0]]]outtrueWhat 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 20 min
solution.py
InputExpectedGot
[4,[[0,1],[1,2],[2,3],[3,0]]]truenot run yetsample