Given an array points where points[i] represents a point $[$x_i, y_i$]$ on a Cartesian plane, return the maximum width of a vertical area between two points such that no points are contained inside the area.

A vertical area is defined as an area of fixed width extending infinitely along the y axis. The width of this vertical area corresponds to the distance between its two vertical boundaries.

Note: Points situated directly on the boundary lines of the vertical area are not considered to be inside the area.

Constraints:

• n $=$ points.length

• $2 \leq$ n $\leq 10^5$

• points[i].length $= 2$

• $0 \leq$ x_i, y_i $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.