Curated list of leetcode problems which are close to the grokking course.
- LC2090. https://leetcode.com/problems/k-radius-subarray-averages/ # more boundary conditions than intro
- Maximum Sum Subarray of Size K (easy): new (link)
def maximumSumSubarray (self,K,nums,N):
if K>len(nums):