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.

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

As required by Google Guidelines, the commit history and the pull request list have been provided in this blog post. To allow the reader to understand the changes made during the work period, I have provided a detailed account of the vital pull requests. For those who just want to see the code changes without going into details, here is a list of my pull requests:

• Stats and Diagnostics
• Plots
• Data
• AOT
• Code profiling and bottleneck identification