So below I made a curated list of leetcode problems, that are as close to grokking problems as possible.

• LC2090. https://leetcode.com/problems/k-radius-subarray-averages/ # more boundary conditions than intro
• Maximum Sum Subarray of Size K (easy): new (link)
• LC53. https://leetcode.com/problems/maximum-subarray/ # Close enough