Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3382. Maximum Area Rectangle With Point Constraints II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source