Minimize Maximum Pair Sum in Array LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @return {number}
4
 */
5
var minPairSum = function (nums) {
6
  nums.sort((a, b) => a - b);
7
  let max = 0;
8
  for (let i = 0; i < nums.length / 2; i++) {
9
    max = Math.max(max, nums[i] + nums[nums.length - 1 - i]);
10
  }
11
  return max;
12
};