Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Still Two Teams? > Editorial

Still Two Teams? — Solution & Editorial

Back to the Problem

Union-find with parity: store each node's color parity relative to its root. Joining two nodes in the same set with equal parity closes an odd cycle — bipartiteness dies. Path compression must recompute parities along the path.

Complexity: O(M α(N))

Watch out: The parity update on union — parity[ru] = p(u) ⊕ p(v) ⊕ 1 — and during compression are both easy to get backwards.