<ul><li>Given an integer array nums and an integer k, find three non-overlapping subarrays of length k with maximum sum and return them.</li><li>Precompute the sums of subarrays of length k and use dynamic programming to calculate the maximum sum of three non-overlapping subarrays.</li><li>Return the result as a list of indices representing the starting position of each interval, in lexicographically smallest order.</li><li>Time complexity is approximately O(n), where n is the length of the input array nums.</li></ul>

689. Maximum Sum of 3 Non-Overlapping Subarrays

Discover more