Leetcode 1877. Minimize Maximum Pair Sum in Array

Given an even-length array, pair up its elements into n/2 disjoint pairs to minimize the largest pair sum and return that minimized maximum. This is a sorting + greedy problem: order the numbers and pair smallest with largest to minimize the worst pair sum.