Today I have done leetcode's June LeetCoding Challenge with cpp.

June LeetCoding Challenge 6

Description

Can Make Arithmetic Progression From Sequence

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.

Example 1:

Input: arr = [3,5,1]
Output: true
Explanation: We can reorder the elements as [1,3,5] or [5,3,1] with differences 2 and -2 respectively, between each consecutive elements.

Example 2:

Input: arr = [1,2,4]
Output: false
Explanation: There is no way to reorder the elements to obtain an arithmetic progression.

Constraints:

• 2 <= arr.length <= 1000
• -106 <= arr[i] <= 106

Solution

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

// Accepted
// 109/109 cases passed (9 ms)
// Your runtime beats 22.98 % of cpp submissions
// Your memory usage beats 28.46 % of cpp submissions (9.1 MB)