gaurishg

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/

gaurishg

class Node:
    def __init__(self, data: int):
        self.data: int = data
        self.prev: Node = None
        self.next: Node = None

    def __repr__(self):
        return f'Node({self.data})'

    def __str__(self):

gaurishg

#!/usr/bin/python3
import sys, os
import typing

args = sys.argv
# print(args)

# This dict will contain data of gate
GateDict = {"Nand": [1, {"Nand": 1}],
"DFF": [4, {"Nand": 4}],