Question

How to find the maximum sum of a sublist of size K in Python

Answer 1

def maximum_sum_sublist(lst, k):
    result = 0
    size = len(lst)
     
    for i in range(size + 1):
        for j in range(i):
            if len(lst[j:i]) == k:
                result = max(result, sum(lst[j:i]))
     
    return result

     
lst = [1, -2, 2, -3, 4, -1, -1, 2, 3, -5, 4] # -1 + 2 + 3 = 4
k = 3

 
print(maximum_sum_sublist(lst, k))
 
 
 
'''
run:
 
4
 
'''

 

70+ SQL courses for beginners and professionals