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.