1637. Widest Vertical Area Between Two Points Containing No Points
Previous1636. Sort Array by Increasing FrequencyNext1638. Count Substrings That Differ by One Character
Last updated
Last updated
https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points
Given n
points
on a 2D plane where points[i] = [xi, yi]
, Returnthe widest vertical area between two points such that no points are inside the area.
A vertical area is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area is the one with the maximum width.
Note that points on the edge of a vertical area are not considered included in the area.
Example 1:
Example 2:
Constraints:
n == points.length
2 <= n <= 105
points[i].length == 2
0 <= xi, yi <= 109