Skip to content

Practice Maximum Area Rectangle With Point Constraints I

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

Medium#3380
LeetCode Problem

Maximum Area Rectangle With Point Constraints I

Problem Statement

Given points, choose four of them as the corners of an axis-aligned rectangle. No other given point may lie inside the rectangle or on its border. Return the largest valid area, or -1 if no such rectangle exists.

Source: Maximum Area Rectangle With Point Constraints I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
points = [[1,1],[1,3],[3,1],[3,3]]
Output
4

# Example 2

Input
points = [[1,1],[1,3],[3,1],[3,3],[2,2]]
Output
-1

# Example 3

Input
points = [[1,1],[1,3],[3,1],[3,3],[1,2],[3,2]]
Output
2

Constraints

1 <= points.length <= 10
points[i].length == 2
0 <= xi, yi <= 100
All the given points are unique.

Related LeetCode Problems

Practice more problems similar to Maximum Area Rectangle With Point Constraints I.

Review your practice with PhantomCodeAI

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