Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Minimize Manhattan Distances

Explore how to compute the minimal maximum Manhattan distance among 2D points after removing one. Understand the role of sums and differences of coordinates in the Manhattan metric, identify critical points, and apply an optimal approach that balances efficiency and accuracy in solving geometric problems.

We'll cover the following...

Statement

You are given an array, points, where each element in points[i] =[xj,yi]= [x_j, y_i] represents the integer coordinates of a point in a 2D plane. The distance between any two points is defined as the Manhattan distanceThe Manhattan distance between two cells (x1, y1) and (x2, y2) is |x_1 - x_2| + |y_1 - y_2|..

Your task is to determine and return the smallest possible value for the maximum distance between any two points after removing exactly one point from the array.

Constraints:

  • 3≤3 \leq points.length ≤103\leq 10^3 ...