Is Graph Bipartite Problem

Is Graph Bipartite Problem — ExecCode Medium DSA Practice

Solve the Is Graph Bipartite problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array graph where graph[u] is an array of nodes adjacent to u. Return true if and only if it is bipartite (nodes can be colored with two colors so every edge joins different colors).

Examples

Input graph = [[1, 5], [0, 2], [1, 3], [2, 4], [3, 5], [0, 4]]; Output true. Input graph = [[1, 2, 3], [0, 2], [0, 1, 3], [0, 2]]; Output false

Constraints

1 ≤ graph.length ≤ 100 0 ≤ graph[u].length < n No self-loops or duplicate edges Graph is undirected

Practice Is Graph Bipartite free on ExecCode. Browse DSA problems, topic map, and placement guides.