DIY: Minimum Area Rectangle
Explore how to solve the minimum area rectangle problem by implementing a function that processes a list of coordinate points. Understand how to identify possible rectangles and compute their areas to return the smallest one, or zero if none exists.
We'll cover the following...
We'll cover the following...
Problem statement
Given an array of points in the X-Y plane points, where points[i] = [xi, yi], you have to return the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes. If there is no such rectangle that can be formed, you ...