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 > Nodes on Cycles > Editorial

Nodes on Cycles — Solution & Editorial

Back to the Problem

A functional graph is 'rho-shaped' per component. Walk from each unvisited node marking a gray path; when you re-hit a gray node, the tail from that node is a cycle. Iterative to avoid recursion limits.

Complexity: O(N)

Watch out: Self-loops (ai = i) are cycles of length 1.