Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Check if There is a Valid Partition For The Array
Coding
- Maximum Number of Ways to Partition an Array
Coding
- Partition Array According to Given Pivot
Coding
- Partition Array for Maximum Sum
Coding · Array · Dynamic Programming
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 561. Array Partition
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source