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.