2026-01-24 16:43:56 +0000 UTC
Minimize Maximum Pair Sum in Array
Links
Code
class Solution:
def minPairSum(self, nums: List[int]) -> int:
nums.sort()
res = float("-inf")
for i in range((len(nums) // 2) + 1):
res = max(res, nums[i] + nums[-i - 1])
return res