Given an undirected graph with $n$ nodes labeled from $0$ to $n - 1$, represented as an adjacency list graph where graph[u] is a list of nodes adjacent to node u.

A graph is bipartite if its nodes can be partitioned into two independent sets such that every edge in the graph connects a node in one set to a node in the other set.

Return true if the given graph is bipartite, or false otherwise.

Constraints:

• graph.length $= n$

• $1 \leq n \leq 100$

• $0 \leq$ graph[u].length $< n$

• $0 \leq$ graph[u][i] $\leq n - 1$

• graph[u] does not contain u

• All the values of graph[u] are unique

• If graph[u] contains v, then graph[v] contains u

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.