Available question text
Given N points on the plane, remove exactly one point to minimize the maximum Manhattan distance between any two remaining points. The challenge is to identify which single point (often one of the extremal points under the Manhattan metric) to remove so that the resulting diameter is as small as possible.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3102. Minimize Manhattan Distances
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source