Bipartite graph check
Given an undirected graph with n nodes (0..n-1) and an edge list, return true if the graph is bipartite (its nodes can be 2-colored so that no edge joins two same-colored nodes) and false otherwise. The graph may be disconnected. There are no self-loops, but there may be duplicate edges.
Implement
is_bipartite(n: int, edges: list[list[int]]) → boolExamples
in
[4,[[0,1],[1,2],[2,3],[3,0]]]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[4,[[0,1],[1,2],[2,3],[3,0]]]truenot run yetsample