1502. Can Make Arithmetic Progression From Sequence(Solution || Leetcode easy || Java)

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 boolean canMakeArithmeticProgression(int[] arr) {
        //First sort the array to get the difference between consecutives
        Arrays.sort(arr);
        
        //get the difference of any two consecutive number
       // from the sorted array
        int diff = arr[0] - arr[1];
        
        //if any one pair do not equal to the diff then that
        // array do not form Arithmetic Progression
        for(int i = 1; i < arr.length-1; i++){
            if(arr[i] - arr[i+1] != diff){
                return false;
            }
        }
        
        return true;
    }
}

Thank you for reading. If you have any queries then, please let me know in the comment section. I will surely be responsive toward it.