Split Friends into Two Groups | Dataford Interview Questions

Split friends into two groups (graph problem) - effectively BFS tracking even and odd levels (bipartite check).

Asked in the coding stage.

Given an undirected graph represented as an adjacency list, return True if its vertices can be divided into two groups such that every edge connects vertices in different groups. Return False otherwise. The graph may be disconnected. The function receives graph, where graph[i] lists the neighbors of vertex i, and returns a Boolean.

Constraints

0 <= len(graph) <= 1000
Each neighbor index is in the range [0, len(graph) - 1]
The graph is undirected, so every edge appears in both adjacency lists
A vertex may have no neighbors

Function Signature

def can_split_friends(graph):

Your question is Split Friends into Two Groups. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Split friends into two groups (graph problem) - effectively BFS tracking even and odd levels (bipartite check).

Asked in the coding stage.

Constraints

0 <= len(graph) <= 1000
Each neighbor index is in the range [0, len(graph) - 1]
The graph is undirected, so every edge appears in both adjacency lists
A vertex may have no neighbors

Function Signature

def can_split_friends(graph):

Your question is Split Friends into Two Groups. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.