1877. Minimize Maximum Pair Sum in Array

/**
 * Problem: LeetCode 1877 - Minimize Maximum Pair Sum in Array
 * Difficulty: Medium
 * Language: Java
 * Author: CodeByTushu
 */
import java.util.Arrays;

class Solution {
    public int minPairSum(int[] nums) {
        Arrays.sort(nums);
        int maxPairSum = 0;
        int left = 0;
        int right = nums.length - 1;

        while (left < right) {
            int currentSum = nums[left] + nums[right];
            maxPairSum = Math.max(maxPairSum, currentSum);
            left++;
            right--;
        }

        return maxPairSum;
    }
}

"""
Problem: LeetCode 1877 - Minimize Maximum Pair Sum in Array
Difficulty: Medium
Language: Python
Author: CodeByTushu
"""
from typing import List

class Solution:
    def minPairSum(self, nums: List[int]) -> int:
        nums.sort()
        max_pair_sum = 0
        left, right = 0, len(nums) - 1

        while left < right:
            pair_sum = nums[left] + nums[right]
            if pair_sum > max_pair_sum:
                max_pair_sum = pair_sum
            left += 1
            right -= 1

        return max_pair_sum

/**
 * Problem: LeetCode 1877 - Minimize Maximum Pair Sum in Array
 * Difficulty: Medium
 * Language: C++
 * Author: CodeByTushu
 */
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int minPairSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int maxPairSum = 0;
        int left = 0;
        int right = static_cast<int>(nums.size()) - 1;

        while (left < right) {
            int currentSum = nums[left] + nums[right];
            maxPairSum = max(maxPairSum, currentSum);
            left++;
            right--;
        }

        return maxPairSum;
    }
};

/**
 * Problem: LeetCode 1877 - Minimize Maximum Pair Sum in Array
 * Difficulty: Medium
 * Language: JavaScript
 * Author: CodeByTushu
 */
/**
 * @param {number[]} nums
 * @return {number}
 */
var minPairSum = function(nums) {
    nums.sort((a, b) => a - b);
    let maxPairSum = 0;
    let left = 0;
    let right = nums.length - 1;

    while (left < right) {
        const currentSum = nums[left] + nums[right];
        if (currentSum > maxPairSum) {
            maxPairSum = currentSum;
        }
        left++;
        right--;
    }

    return maxPairSum;
};