SandKierkegaard

GROKKING NOTES

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

Pattern: Sliding Window

• 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

tykurtz

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

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

Pattern: Sliding Window

• https://leetcode.com/problems/maximum-subarray/ # Close enough
• https://leetcode.com/problems/minimum-size-subarray-sum/