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 > Single Points of Failure > Editorial

Single Points of Failure — Solution & Editorial

Back to the Problem

Lowlink again, with the two classic cases: a non-root u is critical if some child's low ≥ disc[u]; a DFS root is critical iff it has ≥ 2 DFS children. (Note the parent-skip here is by node, unlike bridges.)

Complexity: O(N + M)

Watch out: The root rule (≥ 2 DFS children) is separate from the low ≥ disc rule — most wrong answers forget one.