Available question text
Count the number of 4-point subsets that form a trapezoid — i.e., a convex quadrilateral with at least one pair of parallel sides — from up to 500 distinct points.
The core challenge is combinatorially counting pairs of disjoint point-segments with the same slope (parallel sides) while excluding degenerate/overlapping cases, typically done by grouping point-pairs by reduced slope in O(n^2) time.
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 3625. Count Number of Trapezoids II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source