Maximum Sum Subarray of Size K (easy)

Grokking the Coding Interview: Patterns for Coding Questions

Ask Author

Back to course home

0% completed

Vote For New Content

My simple Python solution

Boris K

Jul 31, 2024

class Solution:
  def findMaxSumSubArray(self,k, arr):
    maxSum = 0
    l = 0
    for i in range(l,len(arr)):
      curSum = sum(arr[l:l+k])
      maxSum = max(maxSum, curSum)
      l += 1
    return maxSum

Comments

On this page