3102. Minimize Manhattan Distances

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. Example 1: Input: points = [[3,10],[5,15],[10,2],[4,4]] Output: 12 Explanation: The maxim