Minimize Maximum Pair Sum in Array LeetCode solution in Python

1
class Solution:
2
    def minPairSum(self, nums: List[int]) -> int:
3
        pair_sum = []
4
        nums.sort()
5
        for i in range(len(nums) // 2):
6
            pair_sum.append(nums[i] + nums[len(nums) - i - 1])
7
        return max(pair_sum)