Widest Vertical Area Between Two Points

lcpy gen -n 1637   # by problem number
lcpy gen -s widest_vertical_area_between_two_points_containing_no_points   # by problem name

Input: points = [[8,7],[9,9],[7,4],[9,7]]
Output: 1
Explanation: Both the red and the blue area are optimal.

Input: points = [[3,1],[9,0],[1,0],[1,4],[5,3],[8,8]]
Output: 3

from itertools import pairwise


class Solution:
    # Time: O(n log n)
    # Space: O(n) for the sorted x-coordinates
    def max_width_of_vertical_area(self, points: list[list[int]]) -> int:
        return max(curr - prev for prev, curr in pairwise(sorted(x for x, _ in points)))