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 > Critical Wires > Editorial

Critical Wires — Solution & Editorial

Back to the Problem

Tarjan lowlink over a DFS forest: edge (parent, u) is a bridge iff low[u] > disc[parent]. Track the parent EDGE ID (not the parent node) so multi-edges are handled; iterate, don't recurse.

Complexity: O(N + M)

Watch out: Skipping the parent NODE instead of the parent EDGE mishandles doubled edges — they are not bridges.