Add solution #1200

Author: JoshCrozier

README.md

@@ -322,6 +322,7 @@
 1108|[Defanging an IP Address](./1108-defanging-an-ip-address.js)|Easy|
 1122|[Relative Sort Array](./1122-relative-sort-array.js)|Easy|
 1189|[Maximum Number of Balloons](./1189-maximum-number-of-balloons.js)|Easy|
+1200|[Minimum Absolute Difference](./1200-minimum-absolute-difference.js)|Easy|
 1206|[Design Skiplist](./1206-design-skiplist.js)|Hard|
 1207|[Unique Number of Occurrences](./1207-unique-number-of-occurrences.js)|Easy|
 1208|[Get Equal Substrings Within Budget](./1208-get-equal-substrings-within-budget.js)|Medium|

solutions/1200-minimum-absolute-difference.js

@@ -0,0 +1,29 @@
+/**
+ * 1200. Minimum Absolute Difference
+ * https://leetcode.com/problems/minimum-absolute-difference/
+ * Difficulty: Easy
+ *
+ * Given an array of distinct integers arr, find all pairs of elements with the minimum absolute
+ * difference of any two elements.
+ *
+ * Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows:
+ * - a, b are from arr
+ * - a < b
+ * - b - a equals to the minimum absolute difference of any two elements in arr
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number[][]}
+ */
+var minimumAbsDifference = function(arr) {
+  arr.sort((a, b) => a - b);
+
+  const min = arr.reduce((m, n, i) => Math.min(m, n - (arr[i - 1] ?? -Infinity)), Infinity);
+  return arr.reduce((result, n, i) => {
+    if (min === n - arr[i - 1]) {
+      result.push([arr[i - 1], n]);
+    }
+    return result;
+  }, []);
+};