Gamified challenge · Bipartite check
There are n guests numbered 0 to n - 1 and two tables, 0 and 1. Each pair rivals[i] = [a, b] says guests a and b are rivals and must not share a table. Guests may have any number of rivals, or none.
Write twoTables(n, rivals) that returns a list of n numbers, the table (0 or 1) of each guest. Any seating with no rivals at the same table passes. If no such seating exists, return an empty list.
Example: n = 5, rivals = [[0, 1], [1, 2], [2, 3], [3, 4]] → [0, 1, 0, 1, 0] (or [1, 0, 1, 0, 1]). With three guests who all dislike each other, the answer is [].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google