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 Nearest Two > Editorial

The Nearest Two — Solution & Editorial

Back to the Problem

Divide and conquer: split by x-median, recurse, then check a vertical strip of width √d sorted by y where only a constant number of neighbours per point matter.

Complexity: O(N log N)

Watch out: Comparing squared distances avoids sqrt precision issues; the strip only needs ~7 y-neighbours per point.