Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3102. Minimize Manhattan Distances
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.