1877. Minimize Maximum Pair Sum in Array

class Solution: def minPairSum(self, nums: List[int]) -> int: ''' Sort it out Scan and track max sum ''' nums.sort() l = len(nums) maxSum = 0 for i in range(l//2): ...