Add solution #1637

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,438 LeetCode solutions in JavaScript
+# 1,439 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1261,6 +1261,7 @@
 1631|[Path With Minimum Effort](./solutions/1631-path-with-minimum-effort.js)|Medium|
 1632|[Rank Transform of a Matrix](./solutions/1632-rank-transform-of-a-matrix.js)|Hard|
 1636|[Sort Array by Increasing Frequency](./solutions/1636-sort-array-by-increasing-frequency.js)|Easy|
+1637|[Widest Vertical Area Between Two Points Containing No Points](./solutions/1637-widest-vertical-area-between-two-points-containing-no-points.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1637-widest-vertical-area-between-two-points-containing-no-points.js

@@ -0,0 +1,26 @@
+/**
+ * 1637. Widest Vertical Area Between Two Points Containing No Points
+ * https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/
+ * Difficulty: Easy
+ *
+ * Given n points on a 2D plane where points[i] = [xi, yi], Return the 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.
+ */
+
+/**
+ * @param {number[][]} points
+ * @return {number}
+ */
+var maxWidthOfVerticalArea = function(points) {
+  points.sort((a, b) => a[0] - b[0]);
+  let result = 0;
+  for (let i = 1; i < points.length; i++) {
+    result = Math.max(result, points[i][0] - points[i - 1][0]);
+  }
+  return result;
+};