<commit_before>package leetcode;

/**
 * https://leetcode.com/problems/is-graph-bipartite/
 */
public class Problem785 {
    public boolean isBipartite(int[][] graph) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem785 prob = new Problem785();
    }
}<commit_msg>Update problem 785<commit_after>package leetcode;

/**
 * https://leetcode.com/problems/is-graph-bipartite/
 */
public class Problem785 {
    public boolean isBipartite(int[][] graph) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem785 prob = new Problem785();
        System.out.println(prob.isBipartite(new int[][]{
            {1, 3}, {0, 2}, {1, 3}, {0, 2}
        })); // true
        System.out.println(prob.isBipartite(new int[][]{
            {1, 2, 3}, {0, 2}, {0, 1, 3}, {0, 2}
        })); // false
    }
}
{'fraction_non_alphanumeric': 0.16481069042316257, 'fraction_numerical': 0.043429844097995544, 'mean_word_length': 2.293040293040293, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 3, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4539837', 'n_tokens_mistral': 326, 'n_tokens_neox': 298, 'n_words': 70}