Problem: Minimize Manhattan Distances

Medium

30 min

Explore how to minimize the maximum Manhattan distance between points after removing exactly one point from an array of 2D coordinates. Understand problem constraints, apply efficient mathematical approaches, and practice your solution in a coding environment to strengthen your geometry and optimization skills.

Statement

You are given an array, points, where each element in points[i] $= [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 \leq$ points.length $\leq 10^3$
points[i].length $== 2$
$1 \leq$ points[i][0], points[i][1] $\leq 10^3$

Problem: Minimize Manhattan Distances

Medium

30 min

Statement

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 \leq$ points.length $\leq 10^3$
points[i].length $== 2$
$1 \leq$ points[i][0], points[i][1] $\leq 10^3$

Problem: Minimize Manhattan Distances

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Minimize Manhattan Distances

Statement

Examples

Understand the problem

Figure it out!

Try it yourself