There are n people labeled from $1$ to n. You are given an array dislikes where each dislikes[i] $= [$ a_i, b_i $]$ indicates that person a_i and person b_i dislike each other.

Return true if it is possible to split everyone into $2$ groups such that no two people in the same group dislike each other, or false otherwise.

Constraints:

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

• $0 \leq$ dislikes.length $\leq 10^4$

• dislikes[i].length $= 2$

• $1 \leq$ a_i $<$ b_i $\leq$ n

• All the pairs of dislikes are unique.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.