Leetcode 561. Array Partition

Given an array of 2n integers, partition the numbers into n pairs to maximize the sum of each pair's minimum value. This is an ordering/greedy problem where choosing which elements to pair (equivalently, arranging the array) determines the maximum 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 561. Array Partition

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact