Leetcode 3473. Sum of K Subarrays With Length at Least M

Pick k non-overlapping subarrays from nums, each of length at least m, to maximize the total sum. The core challenge is selecting optimal interval placements under the non-overlap and minimum-length constraints, typically tackled with dynamic programming over positions and segment counts (n ≤ 2000, m small).