[Algorithm] arrayMaximalAdjacentDifference

Problem

Given an array of integers, find the maximal absolute difference between any two of its adjacent elements.

Example

For inputArray = [2, 4, 1, 0], the output should be
arrayMaximalAdjacentDifference(inputArray) = 3.

Input/Output

• [input] array.integer inputArray

  Guaranteed constraints:
  3 ≤ inputArray.length ≤ 10,
  -15 ≤ inputArray[i] ≤ 15.

• [output] integer

  The maximal absolute difference.

Solution

def arrayMaximalAdjacentDifference(inputArray):
return max([abs(inputArray[i] - inputArray[i+1]) for i in range(len(inputArray) - 1)])