A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is constant.

Given an array of numbers arr, return true if the array can be rearranged to form an arithmetic progression, and false otherwise.

Constraints:

• $2 \leq$ arr.length $\leq 1000$

• $-10^6 \leq$ arr[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.