Practice Minimum Area Rectangle
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an array of points in the X-Y plane points where points[i] = [xi, yi]. Return the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes. If there is not any such rectangle, return 0.
Source: Minimum Area Rectangle 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],[2,2]]
Output
4
# Example 2
Input
points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
Output
2
Constraints
1 <= points.length <= 500
points[i].length == 2
0 <= xi, yi <= 4 * 10^4
All the given points are unique.
Related LeetCode Problems
Practice more problems similar to Minimum Area Rectangle.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.