1877. Minimize Maximum Pair Sum in Array | LeetCode Medium | Python Solution | Array, Counting

Leetcode medium problem 1877. Minimize Maximum Pair Sum in Array, detailed explanation and solution in python language.

#leetcode #python #solution

LeetCode problem solving helps in improving one's problem solving and coding skills . Also, it helps in clearing technical interviews at top tech companies like Microsoft, Google, Amazon, Facebook, Walmart, Apple etc.

Problem Statement:
The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs.

For example, if we have pairs (1,5), (2,3), and (4,4), the maximum pair sum would be max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8.
Given an array nums of even length n, pair up the elements of nums into n / 2 pairs such that:

Each element of nums is in exactly one pair, and
The maximum pair sum is minimized.
Return the minimized maximum pair sum after optimally pairing up the elements.

[muhammedamal]

Thanks bro👍.informative and understanding class

[davidgrace]

Sir but won't it fail when it's 1, 2, 3, 4, 4, 5

So 1, 5
2, 4 instead of 2, 3
Sooo?