Leetcode 1877. Minimize Maximum Pair Sum in Array

Given an even-length array, pair up its elements into n/2 disjoint pairs to minimize the largest pair sum and return that minimized maximum. This is a sorting + greedy problem: order the numbers and pair smallest with largest to minimize the worst pair sum.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1877. Minimize Maximum Pair Sum in Array

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact