LeetCode - Minimize Maximum Pair Sum in Array

Problem statement The pair sum of a pair (a, b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs. For example, if we have pairs (1, 5), (2, 3), and (4, 4), the maximum pair sum would be max(1 + 5, 2 + 3, 4 + 4) = max...