Split people into two groups
You are given n people (0..n-1) and a list of dislike pairs [a, b] meaning a and b refuse to be in the same group. Determine whether everyone can be split into exactly two groups so that no disliking pair shares a group. Return true if possible, false otherwise. This is equivalent to testing whether the dislike graph is bipartite. The graph may be disconnected; duplicate dislike pairs may appear; no self-dislikes.
Implement
possible_two_groups(n: int, dislikes: list[list[int]]) → boolExamples
in
[4,[[0,1],[0,2],[1,3],[2,3]]]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 35 min
solution.py
InputExpectedGot
[4,[[0,1],[0,2],[1,3],[2,3]]]truenot run yetsample