Search
⌘K
Get Premium
Leetcode 3077. Maximum Strength of K Disjoint Subarrays
Select exactly k ordered, non-overlapping subarrays to maximize a weighted sum where the i-th chosen subarray contributes (k-(i-1)) times its sum with alternating signs (k*sum1 - (k-1)*sum2 + (k-2)*sum3 ... + sumk). The core challenge is optimizing this alternating, decreasing-weight linear combination of interval sums — typically solved with dynamic programming over positions and how many subarrays have been chosen.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.