#3381

Maximum Subarray Sum With Length Divisible by K

specialist · 880 · lc medium +31 · 49.6% accepted · 683 likes · top 37%

Description

You are given an integer array nums and an integer k.

Return the maximum sum of any subarray of nums whose length is divisible by k.

Code

1

2

3

class Solution:
    def maxSubarraySum(self, nums: List[int], k: int) -> int:

class Solution:
    def maxSubarraySum(self, nums: List[int], k: int) -> int: