Leetcode 813. Largest Sum of Averages

Partition the array into at most k contiguous non-empty subarrays (using all elements) to maximize the sum of each subarray's average. This is an optimization over partition boundaries — typically solved with dynamic programming (using prefix sums) for n up to 100.