Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3382. Maximum Area Rectangle With Point Constraints II
Given up to 2e5 unique points, find the largest-area axis-aligned rectangle whose four corners are points from the set and that contains no other point on its border or inside. The core challenge is efficiently enumerating candidate corner pairs and verifying rectangle emptiness under tight time/memory constraints.
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.