Possible bipartition
We want to split n people (labeled 1..n) into two groups. You are given dislikes where dislikes[i] = [a, b] means a and b cannot be in the same group. Return true if and only if such a split into exactly two groups is possible (everyone must be placed; either group may be empty). The dislike graph may be disconnected.
Implement
possible_bipartition(n: int, dislikes: list[list[int]]) → boolExamples
in
[4,[[1,2],[1,3],[2,4]]]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 25 min
solution.py
InputExpectedGot
[4,[[1,2],[1,3],[2,4]]]truenot run yetsample