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.