Maximum Area Rectangle With Point Constraints I
Explore how to identify the maximum area rectangle formed by given points on a plane with axis-aligned borders. Understand the constraints that exclude points inside or on the rectangle's edges and learn to implement an efficient solution to return the largest possible rectangle area or -1 if none 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: