<p>We want to split a group of <code>n</code> people (labeled from <code>1</code> to <code>n</code>) into two groups of <strong>any size</strong>. Each person may dislike some other people, and they should not go into the same group.</p>

<p>Given the integer <code>n</code> and the array <code>dislikes</code> where <code>dislikes[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that the person labeled <code>a<sub>i</sub></code> does not like the person labeled <code>b<sub>i</sub></code>, return <code>true</code> <em>if it is possible to split everyone into two groups in this way</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 4, dislikes = [[1,2],[1,3],[2,4]]
<strong>Output:</strong> true
<strong>Explanation:</strong> The first group has [1,4], and the second group has [2,3].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 3, dislikes = [[1,2],[1,3],[2,3]]
<strong>Output:</strong> false
<strong>Explanation:</strong> We need at least 3 groups to divide them. We cannot put them in two groups.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 2000</code></li>
	<li><code>0 &lt;= dislikes.length &lt;= 10<sup>4</sup></code></li>
	<li><code>dislikes[i].length == 2</code></li>
	<li><code>1 &lt;= a<sub>i</sub> &lt; b<sub>i</sub> &lt;= n</code></li>
	<li>All the pairs of <code>dislikes</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    int color[2001];
    bool visited[2001];
    bool isPossible = true;
    void dfs(int i,vector<int> graph[])
    {   
        if(visited[i]){
            return;
        }
        visited[i] = true;

        for(auto node:graph[i]){
            if(color[node]==color[i]){
                isPossible = false;
            }
            if(color[i]==0){
                color[node] = 1;
            }
            else{
                color[node] = 0;
            }
            dfs(node,graph);
        }
    }
    bool possibleBipartition(int n, vector<vector<int>>& dislikes) {
            memset(color,-1,sizeof(color));
            vector<int> graph[2001];
            for(int i=0;i<dislikes.size();i++){
                int a = dislikes[i][0]; int b = dislikes[i][1];
                graph[a].push_back(b);
                graph[b].push_back(a);
            }
            for(int i=1;i<=n;i++){
                if(!visited[i]){
                    color[i] = 0;
                    dfs(i,graph);
                }
            }
            return isPossible;
    }
};
68040