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 Widest Road Trip > Editorial

The Widest Road Trip — Solution & Editorial

Back to the Problem

Add edges in decreasing width into a union-find; the width that first connects 1 and N is the answer (equivalently: the min edge on the 1–N path in a MAXIMUM spanning tree, or binary search + BFS).

Complexity: O(M log M α(N))