Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3380. Maximum Area Rectangle With Point Constraints I
Given up to 10 unique points with integer coordinates, find the largest-area axis-aligned rectangle whose four corners are among the points and that contains no other point on its edges or interior, or return -1 if none exists. The small N makes this a brute-force check over point quadruples (or pairs of x and y coordinates) to verify rectangle corners and absence of interior/boundary points.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.