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 > Farthest by Manhattan > Editorial

Farthest by Manhattan — Solution & Editorial

Back to the Problem

Chebyshev transform: with u = x+y and v = x−y, Manhattan distance equals max(|Δu|, |Δv|), so the answer is max(range of u, range of v) — no pair enumeration.

Complexity: O(N)

Watch out: O(N²) pair checking times out; the u/v rotation is the entire trick.