LeetCode 1877: Minimize Maximum Pair Sum in Array Solution

Master LeetCode problem 1877 (Minimize Maximum Pair Sum in Array), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1877. Minimize Maximum Pair Sum in Array

Medium

Array Two Pointers Greedy Sorting

Problem Explanation

Explanation

To minimize the maximum pair sum, we can pair the largest element with the smallest element, the second largest with the second smallest, and so on. This way, the difference between elements in each pair will be minimized, leading to a minimized maximum pair sum.

Sort the input array nums.
Initialize two pointers, left pointing to the start of the array and right pointing to the end.
Pair up nums[left] with nums[right], calculate the pair sum, and update the maximum pair sum if needed.
Increment left and decrement right.
Repeat steps 3-4 until left >= right.

Time complexity: O(nlogn) - Sorting the array takes O(nlogn) time. Space complexity: O(1) - Constant extra space is used.

Solution Code

class Solution {
    public int minPairSum(int[] nums) {
        Arrays.sort(nums);
        int left = 0, right = nums.length - 1;
        int minMaxPairSum = Integer.MIN_VALUE;
        
        while (left < right) {
            int pairSum = nums[left] + nums[right];
            minMaxPairSum = Math.max(minMaxPairSum, pairSum);
            left++;
            right--;
        }
        
        return minMaxPairSum;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1877 (Minimize Maximum Pair Sum in Array)?

This page provides optimized solutions for LeetCode problem 1877 (Minimize Maximum Pair Sum in Array) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1877 (Minimize Maximum Pair Sum in Array)?

The time complexity for LeetCode 1877 (Minimize Maximum Pair Sum in Array) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1877 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1877 in Java, C++, or Python.

Back to LeetCode Solutions