Maximum Area Rectangle With Point Constraints I
Understand how to identify the largest rectangle on a coordinate plane formed by four points with borders parallel to the x and y axes. Learn to ensure no other points lie inside or on the rectangle edges, and apply problem-solving techniques to return the maximum area or -1 if no rectangle exists.
We'll cover the following...
We'll cover the following...
Statement
You are given an array of points, where points[i] have two values: