Here is the interview question prompt, presented for reference.

Question

Given a graph, can you use two colors to color each node of the graph, such that no two adjacent nodes have the same color?

The Problem

The graph coloring problem is a well-known problem in computer science. It requires coloring different nodes of the graph so that two adjacent nodes do not have the same color.

In this challenge, we'll look at a special case of this problem, where we'll determine if two colors suffice for graph coloring or not. The 2 coloring problem is also equivalent to creating a partition of a set of elements, so that two connected elements are in two different partitions.

You can see the full challenge with visuals at this link.