#3102
Minimize Manhattan Distances
hard · 32.9% accepted · 186 likes · top 10%
array · math · geometry · sorting · ordered set
Description
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.
Solution