Skip to content

Practice Maximize the Distance Between Points on a Square

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3464
LeetCode Problem

Maximize the Distance Between Points on a Square

Problem Statement

You are given an integer side, representing the edge length of a square with corners at (0, 0), (0, side), (side, 0), and (side, side) on a Cartesian plane. You are also given a positive integer k and a 2D integer array points, where points[i] = [xi, yi] represents the coordinate of a point lying on the boundary of the square. You need to select k elements among points such that the minimum Manhattan distance between any two points is maximized. Return the maximum possible minimum Manhattan distance between the selected k points. The Manhattan Distance between two cells (xi, yi) and (xj, yj) is |xi - xj| + |yi - yj|.

Source: Maximize the Distance Between Points on a Square on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
side = 2, points = [[0,2],[2,0],[2,2],[0,0]], k = 4
Output
2

# Example 2

Input
side = 2, points = [[0,0],[1,2],[2,0],[2,2],[2,1]], k = 4
Output
1

# Example 3

Input
side = 2, points = [[0,0],[0,1],[0,2],[1,2],[2,0],[2,2],[2,1]], k = 5
Output
1

Constraints

1 <= side <= 10^9
4 <= points.length <= min(4 * side, 15 * 10^3)
points[i] == [xi, yi]
The input is generated such that: points[i] lies on the boundary of the square. All points[i] are unique.
points[i] lies on the boundary of the square.
All points[i] are unique.
4 <= k <= min(25, points.length)

Related LeetCode Problems

Practice more problems similar to Maximize the Distance Between Points on a Square.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.