LeetCode Entry

1877. Minimize Maximum Pair Sum in Array

24.01.2026 medium 2026 kotlin rust

Min max pair

1877. Minimize Maximum Pair Sum in Array medium blog post substack youtube

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1247

Problem TLDR

Min max pair #medium #brainteaser

Intuition

Sort. Pair maxes with mins.

Approach

• counting sort works too

Complexity

• Time complexity: \(O(nlog(n))\)

• Space complexity: \(O(n)\)

Code

// 629ms
    fun minPairSum(n: IntArray) =
    n.run{sort();zip(reversed(),Int::plus).max()}

// 13ms
    pub fn min_pair_sum(mut n: Vec<i32>) -> i32 {
        let (mut c,mut i) = ([0; 100001],0); for &x in &n { c[x as usize]+=1 }
        for v in 0..100001 { for _ in 0..c[v] { n[i]=v as i32;i+=1}}
        n.iter().zip(n.iter().rev()).map(|(a,b)|a+b).max().unwrap()
    }