Problem

Given an array of integers, write a function that returns the largest difference between any two elements in the array.
Example input: [2, 4, 6, 10]
Example output: 8

Solution

// Solution:
// The optimal solution is to sort the array and then subtract the first element from the last element.
// This is optimal because it is O(n log n) time complexity.

function largestDifference(arr) {
  arr.sort((a, b) => a - b);
  return arr[arr.length - 1] - arr[0];
}

console.log(largestDifference([2, 4, 6, 10]));