Available question text
Partition the array into n/3 triplets and maximize the sum of their medians; the key insight is that after sorting you can greedily choose the k = n/3 medians by taking every second element starting from index k (indices k, k+2, …, 3k-2).
Related questions
Continue with questions that share topics or the same question type.
- Maximum and Minimum Sums of at Most Size K Subsequences
Coding
- Maximum Product of Subsequences With an Alternating Sum Equal to K
Coding
- Maximum Size Subarray Sum Equals k
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
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 3627. Maximum Median Sum of Subsequences of Size 3
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source