Available question text
Given n points, return twice the maximum area of any triangle whose at least one side is axis-parallel (or -1 if none); this reduces to maximizing base*height where the base is the distance between two points sharing x or y and the height is the perpendicular distance to a third point. Key idea: consider pairs of points with equal x or equal y and combine with a third point at a different coordinate to maximize base*height (n up to 1e5 so group/scan efficiently).
Related questions
Continue with questions that share topics or the same question type.
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find Maximum Hidden Island Size
Coding
- Find Maximum Non-decreasing Array Length
Coding
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 3588. Find Maximum Area of a Triangle
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source