Leetcode 886. Possible Bipartition

Given n people and pairwise dislikes, determine whether the corresponding undirected graph is bipartite — i.e., whether you can 2-color all vertices (split into two groups) so no dislike pair lies within the same group (n ≤ 2000, dislikes ≤ 10^4).