#3102

Minimize Manhattan Distances

international master · 1910 · lc hard +32 · 32.9% accepted · 186 likes · top 10%

Description

Given an array points of 2D integer coordinates, remove exactly one point to minimize the maximum pairwise Manhattan distance among the remaining points. Return that minimized maximum distance.

Code

1

2

3

class Solution:
    def minimumDistance(self, points: List[List[int]]) -> int:

class Solution:
    def minimumDistance(self, points: List[List[int]]) -> int: