Search⌘ K
AI Features

Solution: Minimum Area Rectangle

Explore a method to determine the minimum area rectangle formed by given points on a 2D plane. This lesson teaches you how to identify rectangles using diagonal points, efficiently check for vertex existence, and compute the minimal area using a set data structure. Understand the problem constraints, apply coordinate encoding for fast lookup, and practice implementing the solution with a time complexity of O(n²).

Statement

You are given an array of points, where point[i] =[xi,yi]= [x_i, y_i] represents a point on a 2D plane.

Your task is to determine the minimum area of a rectangle that can be formed using any four points where the rectangle’s sides are aligned parallel to the X and Y axes. If no such rectangle can be formed, return 00.

Constraints:

  • 11 \leq points.length 500\leq 500

  • points[i].length ==2== 2

  • ...