3025. Find the Number of Ways to Place People I

LeetCodeArrayMathGeometrySortingEnumerationOpen on judge ↗

You are given a 2D array points of size n x 2 representing integer coordinates of some points on a 2D plane, where points[i] = [xi, yi]. Count the number of pairs of points (A, B), where - A is on the upper left side of B, and - there are no other points in the rectangle (or line) they make (including the border), except for the points A and B. Return the count. Example 1: Input: points =

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