Leetcode 3627. Maximum Median Sum of Subsequences of Size 3

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).