RESULT: https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/submissions/1215776366

1637.py

class Solution:
    def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
        #  O(n log n)
        points.sort()  # X koordinata bo'yicha sort qb olamiz (sort doim birinchi item bo'yicha sortlab oladi, bizni holatimizda bu [X,Y] dan X)
        max_width = 0 # Natija
        for i in range(len(points) - 1):
            # Hozirgi va bitta oldingi X koordinatalar o'rtasidagi farqni topib olamiz
            diff_width = points[i][0] - points[i - 1][0]
            # Natijani qaisi biri kattaligiga qarab belgilab olamz
            max_width = max(max_width, diff_width)
        return max_width

        #  O(n log n) 
        x_coords = sorted(point[0] for point in points)  # faqat X kordinata bo'yicha sortlab olamiz (shu uchun saal tezroq)
        return max(x_coords[i] - x_coords[i - 1] for i in range(1, len(x_coords)))