Challenge: Maximum Sum Sublist of Size K

Maximum subarray sum

In a given unsorted list, the maximum sum of a continuous sublist is the one whose elements, when added together, give the largest possible sum.

This problem is a tricky one because the list might have negative integers in any position, so, we have to cater to those negative integers while choosing the continuous sublist with the largest positive values of size k.

Extreme cases

Have a look at the following extreme/boundary cases for a closer understanding of the problem.