Bipartite Interview Questions

Decide whether a group of people can be split in two so that no pair who refuse to be together ends up on the same side. Asked at Microsoft, this is a two-colouring question on the conflict graph, and the detail that trips people is that the graph can be disconnected, so every component needs its own search. You will colour as you traverse, detect the odd cycle that makes a split impossible, and handle people with no conflicts at all. The full problem and the reference solution require a subscription.

A coding question on undirected graphs given as a list of pairs: can the vertices be split into two groups with every connection crossing between groups? It probes care with graphs made of several separate pieces, isolated vertices, repeated pairs and vertices joined to themselves, at a size where a deep call stack is not an option.

In this graph theory puzzle, frequently asked during technical evaluations at WeRide, you are tasked with verifying whether a collection of interconnected nodes can be cleanly split into two separate partitions without any internal edges. The evaluation checks your fluency in traversal strategies, such as breadth-first or depth-first search, alongside coloring techniques to detect cyclic conflicts. Successfully solving this challenge demonstrates your capability to model relationships and recognize fundamental network topologies. To explore the complete problem description and review a comprehensive model solution, a paid subscription is required.