Largest Subarray Sum

2022-04-17.py

question = """

Given an unsorted array of integers and a number n, find the subarray of length n that has the largest sum.

Example:

$ largestSubarraySum([3,1,4,1,5,9,2,6], 3)
$ [9, 2, 6]


"""

from functools import reduce

def largestSubarraySum(a, l):
    largest_sum = 0
    largest_sum_i = 0
    for i in range(0, len(a)-2):
        t = reduce(lambda x, y: x + y, a[i:i+3])
        if t > largest_sum:
            largest_sum = t
            largest_sum_i = i
    return a[largest_sum_i:largest_sum_i+3]

print(largestSubarraySum([3,1,4,1,5,9,2,6], 3))