Add solution #1502

Author: JoshCrozier

README.md

@@ -174,6 +174,7 @@
 1486|[XOR Operation in an Array](./1486-xor-operation-in-an-array.js)|Easy|
 1492|[The kth Factor of n](./1492-the-kth-factor-of-n.js)|Medium|
 1496|[Path Crossing](./1496-path-crossing.js)|Easy|
+1502|[Can Make Arithmetic Progression From Sequence](./1502-can-make-arithmetic-progression-from-sequence.js)|Easy|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|

solutions/1502-can-make-arithmetic-progression-from-sequence.js

@@ -0,0 +1,27 @@
+/**
+ * 1502. Can Make Arithmetic Progression From Sequence
+ * https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/
+ * Difficulty: Easy
+ *
+ * A sequence of numbers is called an arithmetic progression if the difference
+ * between any two consecutive elements is the same.
+ *
+ * Given an array of numbers arr, return true if the array can be rearranged to
+ * form an arithmetic progression. Otherwise, return false.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {boolean}
+ */
+var canMakeArithmeticProgression = function(arr) {
+  arr.sort((a, b) => a - b);
+
+  for (let i = 2, diff = arr[1] - arr[0]; i < arr.length; i++) {
+    if (arr[i] - arr[i - 1] !== diff) {
+      return false;
+    }
+  }
+
+  return true;
+};