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 > The Runner-Up Route > Editorial

The Runner-Up Route — Solution & Editorial

Back to the Problem

Dijkstra with two distance slots per node (best and second-best distinct); relax both. Because walks may backtrack, the second value always propagates correctly.

Complexity: O(M log N)

Watch out: Strictly second: equal-length alternative paths do NOT count — the two slots must hold distinct values.