siddhantmedar

import heapq
from collections import Counter


class Obj:
    def __init__(self, a, b):
        self.a = a
        self.b = b

    def __lt__(self, other):

siddhantmedar

System Design Cheatsheet

Picking the right architecture = Picking the right battles + Managing trade-offs

Basic Steps

1. Clarify and agree on the scope of the system

• User cases (description of sequences of events that, taken together, lead to a system doing something useful)
  • Who is going to use it?
  • How are they going to use it?

siddhantmedar

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/

siddhantmedar

def isSafe(i, j, num, n):
    for k in range(n):
        if board[i][k] == num or board[k][j] == num:
            return False

    sx, sy = (i // 3) * 3, (j // 3) * 3

    for x in range(sx, sx + 3):
        for y in range(sy, sy + 3):
            if board[x][y] == num:

siddhantmedar

def dfs(graph, node):
    global timer

    visited.add(node)

    timer += 1

    disc[node] = low[node] = timer
    inStack[node] = True
    st.append(node)

siddhantmedar

class Solution:
    def numIslands(self, mat: List[List[str]]) -> int:
        def find(a):
            if a != parent[a]:
                parent[a] = find(parent[a])

            return parent[a]
    
    
        def union(x,y):

siddhantmedar

First, clone the llama.cpp repository and follow the steps below:

git clone https://github.com/ggerganov/llama.cpp.git
cd llama.cpp
git checkout b3345
git submodule update --init --recursive
make clean
make all -j
git log -1
Credits to Zhangy-ly for this fix.