Interview Course Based on Story Questions

# Problem statement
In this challenge, you will be given an undirected graph. Your task is to determine if this graph is [bipartite](https://www.educative.io/edpresso/what-is-a-bipartite-graph) or not. 

> A graph is bipartite if we can split its set of nodes into two independent subsets, `A` and `B`, such that every edge in the graph has one node in `A` and another node in `B`.

## Input
An undirected graph is given as input. This graph will be represented by a 2D array such that `graph[i]` will contain a list of indices `j` for which the edge between nodes i and j exists. Each node in the graph is denoted by integers from `0` to `graph.length-1`. 

For example, the input can be:
```
graph = [[1], [0, 3], [3], [1, 2]]
```
This graph can be illustrated as:


DIY: Is Graph Bipartite?

Problem statement