Solution: Possible Bipartition

Statement

You are given an integer n representing people labeled from $1$ to n, and a list dislikes where each element is a pair [a_i, b_i] indicating that person a_i and person b_i dislike each other.

Determine whether it is possible to split all n people into exactly $2$ groups such that no pair in dislikes has both people placed in the same group. Return true if such a partition exists, otherwise return false.

Constraints:

• $1 \leq$ n $\leq 2000$

• ...