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 Spanning Tree > Editorial

The Runner-Up Spanning Tree — Solution & Editorial

Back to the Problem

A second-best spanning tree differs from the MST by exactly one edge. Build the MST, then for each MST edge try removing it and rebuilding the cheapest spanning tree without it; take the minimum. (The classic O(N²) method precomputes max path edges.)

Complexity: O(N · M log M)

Watch out: Excluding an MST edge may disconnect the graph — the rebuild must verify a full spanning tree still forms.