add 1877. Minimize Maximum Pair Sum in Array

https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/

Author: sayeed205

Medium/ Code Testcase 1877. Minimize Maximum Pair Sum in Array/1877. Minimize Maximum Pair Sum in Array.java

@@ -0,0 +1,16 @@
+import java.util.Arrays;
+
+class Solution {
+    public int minPairSum(int[] nums) {
+        Arrays.sort(nums);
+
+        int maxPairSum = 0;
+        int n = nums.length;
+
+        for (int i = 0; i < n / 2; i++) {
+            maxPairSum = Math.max(maxPairSum, nums[i] + nums[n - i - 1]);
+        }
+
+        return maxPairSum;
+    }
+}

Medium/ Code Testcase 1877. Minimize Maximum Pair Sum in Array/1877. Minimize Maximum Pair Sum in Array.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minPairSum = function (nums) {
+    nums.sort((a, b) => a - b);
+
+    let maxPairSum = 0;
+    const n = nums.length;
+
+    for (let i = 0; i < n / 2; i++) {
+        maxPairSum = Math.max(maxPairSum, nums[i] + nums[n - i - 1]);
+    }
+
+    return maxPairSum;
+};

Medium/ Code Testcase 1877. Minimize Maximum Pair Sum in Array/1877. Minimize Maximum Pair Sum in Array.py

@@ -0,0 +1,13 @@
+from typing import List
+
+class Solution:
+    def minPairSum(self, nums: List[int]) -> int:
+        nums.sort()
+
+        max_pair_sum = 0
+        n = len(nums)
+
+        for i in range(n // 2):
+            max_pair_sum = max(max_pair_sum, nums[i] + nums[n - i - 1])
+
+        return max_pair_sum

Medium/ Code Testcase 1877. Minimize Maximum Pair Sum in Array/1877. Minimize Maximum Pair Sum in Array.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn min_pair_sum(nums: Vec<i32>) -> i32 {
+        let mut nums = nums;
+        nums.sort();
+
+        let mut max_pair_sum = 0;
+        let n = nums.len();
+
+        for i in 0..n / 2 {
+            max_pair_sum = max_pair_sum.max(nums[i] + nums[n - i - 1]);
+        }
+
+        max_pair_sum
+    }
+}

Medium/ Code Testcase 1877. Minimize Maximum Pair Sum in Array/1877. Minimize Maximum Pair Sum in Array.ts

@@ -0,0 +1,12 @@
+function minPairSum(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+
+    let maxPairSum = 0;
+    const n = nums.length;
+
+    for (let i = 0; i < n / 2; i++) {
+        maxPairSum = Math.max(maxPairSum, nums[i] + nums[n - i - 1]);
+    }
+
+    return maxPairSum;
+}

Medium/ Code Testcase 1877. Minimize Maximum Pair Sum in Array/README.md

@@ -0,0 +1,37 @@
+## [1877. Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)
+
+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_.
+
+#### Example 1:
+
+<pre>
+<strong>Input:</strong> nums = [3,5,2,3]
+<strong>Output:</strong> 7
+<strong>Explanation:</strong> The elements can be paired up into pairs (3,3) and (5,2).
+The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7.
+</pre>
+
+#### Example 2:
+
+<pre>
+<strong>Input:</strong> nums = [3,5,4,2,4,6]
+<strong>Output:</strong> 8
+<strong>Explanation:</strong> The elements can be paired up into pairs (3,5), (4,4), and (6,2).
+The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8.
+</pre>
+
+#### Constraints:
+
+-   `n == nums.length`
+-   <code>2 <= n <= 10<sup>5</sup></code>
+-   `n` is **even**.
+-   <code>1 <= nums[i] <= 10<sup>5</sup></code>