넘치게 채우기

https://leetcode.com/problems/count-number-of-trapezoids-ii/editorial/?envType=daily-question&envId=2025-12-03LeetCode - Count Number of Trapezoids II문제 유형: 기하학, 해시문제 난이도: Hard 문제You are given a 2D integer array points where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane.Return the number of unique trapezoids that can be formed by choosing any four distin..

https://leetcode.com/problems/count-number-of-trapezoids-i/description/?envType=daily-question&envId=2025-12-02LeetCode - Count Number of Trapezoids I문제 유형: 기하학문제 난이도: Medium 문제You are given a 2D integer array points, where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane.A horizontal trapezoid is a convex quadrilateral with at least one pair of horizontal ..