Available question text
Count the number of distinct convex quadrilaterals (trapezoids) that can be formed from given points such that at least one pair of opposite sides is horizontal. The challenge is to efficiently count these combinations for up to 1e5 points by grouping points by y-coordinate and using combinatorial counting over pairs of horizontal lines and matching x-values, returning the result modulo 1e9+7.
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 3623. Count Number of Trapezoids I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source