Maximum Subarray Sum With Length Divisible by K - Leetcode 3381 - Python
NeetCodeIO · 21:59
NeetCode solves "Maximum Subarray Sum With Length Divisible by K" in O(n) time and O(k) space. He combines prefix sums with a size-k array that holds, for each value of (prefix length mod k), the smallest prefix sum s...