D - Tile Pattern

B - Arbitrary Nim

E - Stamp

F - Colored Ball

F - Good Set Query

E - Maximize Rating

D - ABC Puzzle

E - Revenge of “The Salary of AtCoder Inc.”

F - SSttrriinngg in StringString

3102. Minimize Manhattan Distances

You are given a 0-indexed 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.