29.md

Minimum Maximum Pair Sum in Array

METHOD 1(TWO POINTER)

int minPairSum(vector<int>& nums) {
        
        sort(nums.begin(),nums.end());

        int left=0,right=nums.size()-1;

        int maxSum=INT_MIN;

        while(right>left)
        {
            int curSum=nums[left]+nums[right];

            maxSum=max(maxSum,curSum);
            left++;
            right--;
        }

        return maxSum;
    }