Solution 1 - Sort and Check Differences

After sorting, all adjacent differences must match.

TimeComplexity: O(n \log n)

SpaceComplexity: O(1)

""" 1502.1 - Can Make Arithmetic Progression From Sequence - Solution 1 - Sort """

from typing import List

class Solution:
    def canMakeArithmeticProgression(self, arr: List[int]) -> bool:
        arr.sort()
        d = arr[1] - arr[0]
        for i in range(2, len(arr)):
            if arr[i] - arr[i-1] != d:
                return False
        return True

package main

import "sort"

func canMakeArithmeticProgression(arr []int) bool {
	sort.Ints(arr)
	d := arr[1] - arr[0]
	for i := 2; i < len(arr); i++ {
		if arr[i]-arr[i-1] != d {
			return false
		}
	}
	return true
}

func main() {}

fn can_make_arithmetic_progression(mut arr: Vec<i32>) -> bool {
	arr.sort_unstable();
	let d = arr[1] - arr[0];
	for i in 2..arr.len() {
		if arr[i] - arr[i-1] != d { return false; }
	}
	true
}
fn main() {}

1502 - Can Make Arithmetic Progression From Sequence

Solution 1 - Sort and Check Differences