title: Check Whether Arithmetic Progression Can Formed Given Array
signature: checkWhetherArithmeticProgressionCanFormedGivenArray :: [Integer] -> Integer -> Bool
  checkWhetherArithmeticProgressionCanFormedGivenArray arr n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Bool -> Bool -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Bool -> String
  driver arr n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME arr n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ([1, 4, 16, 64]) (4) (False) )
  
      printf "TEST-1...%s\n" (driver ([0, 4, 8, 12]) (4) (True) )
  
      printf "TEST-2...%s\n" (driver ([-2, 0, 2, 4, 6]) (5) (True) )
  
      printf "TEST-3...%s\n" (driver ([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]) (7) (True) )
  
      printf "TEST-4...%s\n" (driver ([46, 56, 66, 76, 86]) (5) (True) )
  
      printf "TEST-5...%s\n" (driver ([46, 56, 56, 66, 76, 86]) (6) (False) )
  
      printf "TEST-6...%s\n" (driver ([7, 9, 11, 21, 44, 45, 61, 67, 78, 97, 98, 99]) (11) (False) )
  
      printf "TEST-7...%s\n" (driver ([-96, -84, -74, -70, -68, -62, -50, -50, -38, -36, -36, -36, -34, -34, -28, -28, -26, -18, -12, -4, -4, -2, -2, 6, 6, 14, 24, 34, 36, 44, 50, 54, 54, 62, 64, 66, 70, 74, 74, 78, 84, 86]) (33) (False) )
  
      printf "TEST-8...%s\n" (driver ([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]) (33) (False) )
  
      printf "TEST-9...%s\n" (driver ([1, 3, 5, 11, 14, 15, 15, 17, 18, 19, 20, 20, 22, 32, 33, 35, 36, 37, 39, 44, 45, 46, 51, 54, 57, 58, 61, 61, 63, 64, 67, 69, 70, 70, 79, 82, 86, 89, 92, 93, 95, 99]) (40) (False) )
  
source_py: def check_whether_arithmetic_progression_can_formed_given_array(arr, n):
      if (n == 1):
          return True
      arr.sort()
      d = (arr[1] - arr[0])
      for i in range(2, n):
          if ((arr[i] - arr[(i - 1)]) != d):
              return False
      return True
source_cpp: bool check_whether_arithmetic_progression_can_formed_given_array(vector<int> arr, int n) {
    if ( n == 1 ) return true;
    sort(arr.begin(), arr.end());
    int d = arr [ 1 ] - arr [ 0 ];
    for ( int i = 2;
    i < n;
    i ++ ) if ( arr [ i ] - arr [ i - 1 ] != d ) return false;
    return true;
  }