Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g1501_1600.s1502_can_make_arithmetic_progression_from_sequence.Solution

```
public class Solution
extends Object
```
1502 - Can Make Arithmetic Progression From Sequence.
Easy

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
- -10⁶ <= arr[i] <= 10⁶

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean canMakeArithmeticProgression(int[] arr)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

canMakeArithmeticProgression

public boolean canMakeArithmeticProgression(int[] arr)