Nicholas-Kipkoech

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/

Nicholas-Kipkoech

:root {
    --primary-color: #005fff;
    --primary-color-alpha: #005fff1a;
  }
  
  html,
  body {
    margin: 0;
    padding: 0;
    height: 100%;