Skip to content

Practice Minimize Manhattan Distances

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3102
LeetCode Problem

Minimize Manhattan Distances

Problem Statement

You are given an array points representing integer coordinates of some points on a 2D plane, where points[i] = [xi, yi]. The distance between two points is defined as their Manhattan distance. Return the minimum possible value for maximum distance between any two points by removing exactly one point.

Source: Minimize Manhattan Distances on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
points = [[3,10],[5,15],[10,2],[4,4]]
Output
12

# Example 2

Input
points = [[1,1],[1,1],[1,1]]
Output
0

Constraints

3 <= points.length <= 10^5
points[i].length == 2
1 <= points[i][0], points[i][1] <= 10^8

Related LeetCode Problems

Practice more problems similar to Minimize Manhattan Distances.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.