Solution: Is Graph Bipartite?

Statement

You are given an undirected graph represented by an adjacency list graph, where each node is labeled from $0$ to $n - 1$ and graph[u] lists all nodes adjacent to node u. Determine whether the graph is bipartite, meaning you can split all nodes into two disjoint groups such that every edge connects a node in one group to a node in the other group. Return true if such a partition exists, otherwise return false.

Constraints:

• graph.length == n

• $1 \leq$ ...