Leetcode 3143. Maximum Points Inside the Square

Choose an axis-aligned square centered at the origin to maximize the number of points inside it with all tags distinct. Because a square includes exactly the points with max(|x|,|y|) ≤ r, sort points by that value and sweep increasing r while tracking tag frequencies to find the largest prefix with no duplicate tags.