Add solution #164

Author: JoshCrozier

README.md

@@ -134,6 +134,7 @@
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
 160|[Intersection of Two Linked Lists](./0160-intersection-of-two-linked-lists.js)|Medium|
+164|[Maximum Gap](./0164-maximum-gap.js)|Medium|
 167|[Two Sum II - Input Array Is Sorted](./0167-two-sum-ii-input-array-is-sorted.js)|Easy|
 168|[Excel Sheet Column Title](./0168-excel-sheet-column-title.js)|Easy|
 169|[Majority Element](./0169-majority-element.js)|Easy|

solutions/0164-maximum-gap.js

@@ -0,0 +1,21 @@
+/**
+ * 164. Maximum Gap
+ * https://leetcode.com/problems/maximum-gap/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, return the maximum difference between two successive elements in
+ * its sorted form. If the array contains less than two elements, return 0.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maximumGap = function(nums) {
+  nums.sort((a, b) => a - b);
+  let result = 0;
+  for (let i = 1; i < nums.length; i++) {
+    result = Math.max(result, nums[i] - nums[i - 1]);
+  }
+  return result;
+};