LeetCode 1502: Can Make Arithmetic Progression From Sequence

Explanation:

To determine if an array can be rearranged to form an arithmetic progression, we need to check if the differences between any two consecutive elements are the same. We can achieve this by sorting the array and then checking if the differences between adjacent elements are consistent.

Algorithm:

1. Sort the input array.
2. Calculate the common difference between the first two elements.
3. Iterate through the array and check if the differences between consecutive elements are the same as the common difference.
4. If any difference is not equal to the common difference, return false. Otherwise, return true.

Time Complexity:

The time complexity of this solution is O(n log n) due to the sorting step where n is the number of elements in the input array.

Space Complexity:

The space complexity of this solution is O(1) as we are not using any extra space apart from a few variables.

:

class Solution {
    public boolean canMakeArithmeticProgression(int[] arr) {
        Arrays.sort(arr);
        int diff = arr[1] - arr[0];
        for (int i = 2; i < arr.length; i++) {
            if (arr[i] - arr[i - 1] != diff) {
                return false;
            }
        }
        return true;
    }
}