3382. Maximum Area Rectangle With Point Constraints II

LeetCodeArrayMathBinary Indexed TreeSegment TreeGeometrySortingOpen on judge ↗

There are n points on an infinite plane. You are given two integer arrays xCoord and yCoord where (xCoord[i], yCoord[i]) represents the coordinates of the ith point. Your task is to find the maximum area of a rectangle that: - Can be formed using four of these points as its corners. - Does not contain any other point inside or on its border. - Has its edges parallel to the axes. Return the ma

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI