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 > Strongly Connected Pieces > Editorial

Strongly Connected Pieces — Solution & Editorial

Back to the Problem

Kosaraju (two DFS passes: finish order on G, then flood on the reverse graph) or Tarjan's lowlink — both linear. Recursive DFS overflows stacks at these sizes; use an explicit stack.

Complexity: O(N + M)

Watch out: Iterative DFS or a raised recursion limit — 104-deep recursion crashes most defaults.