Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 12.8 MB (42.12%)

Author: koralkulacoglu

LeetCode/1626-can-make-arithmetic-progression-from-sequence/README.md

@@ -0,0 +1,28 @@
+<p>A sequence of numbers is called an <strong>arithmetic progression</strong> if the difference between any two consecutive elements is the same.</p>
+
+<p>Given an array of numbers <code>arr</code>, return <code>true</code> <em>if the array can be rearranged to form an <strong>arithmetic progression</strong>. Otherwise, return</em> <code>false</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [3,5,1]
+<strong>Output:</strong> true
+<strong>Explanation: </strong>We can reorder the elements as [1,3,5] or [5,3,1] with differences 2 and -2 respectively, between each consecutive elements.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [1,2,4]
+<strong>Output:</strong> false
+<strong>Explanation: </strong>There is no way to reorder the elements to obtain an arithmetic progression.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= arr.length &lt;= 1000</code></li>
+	<li><code>-10<sup>6</sup> &lt;= arr[i] &lt;= 10<sup>6</sup></code></li>
+</ul>

LeetCode/1626-can-make-arithmetic-progression-from-sequence/solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    bool canMakeArithmeticProgression(vector<int>& arr) {
+        int n = arr.size();
+        sort(arr.begin(), arr.end());
+        int diff = arr[1] - arr[0];
+        for (int i=1; i<n; i++) {
+            if (arr[i] - arr[i-1] != diff) return false;
+        }
+        return true;
+    }
+};