package leetcode;

/**
 * https://leetcode.com/problems/possible-bipartition/
 */
public class Problem886 {
    public boolean possibleBipartition(int N, int[][] dislikes) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem886 prob = new Problem886();
    }
}

@@ -301,16 +301,340 @@
 m886();%0A
+        System.out.println(prob.possibleBipartition(4, new int%5B%5D%5B%5D%7B%7B1, 2%7D, %7B1, 3%7D, %7B2, 4%7D%7D)); // true%0A        System.out.println(prob.possibleBipartition(3, new int%5B%5D%5B%5D%7B%7B1, 2%7D, %7B1, 3%7D, %7B2, 3%7D%7D)); // false%0A        System.out.println(prob.possibleBipartition(5, new int%5B%5D%5B%5D%7B%7B1, 2%7D, %7B2, 3%7D, %7B3, 4%7D, %7B4, 5%7D, %7B1, 5%7D%7D)); // false%0A
     %7D%0A%7D%0A

Update problem 886