Explorer
blog
adding my spotify activity to my website
cracked individual bucket list
guide to boba in the bay
maximizing credit card rewards
notes
abort controller
acid
amortized analysis
anaconda
argocd
arrow functions
assembly
ast (abstract syntax tree)
asymmetric encryption
asymptotic notation
atomicity
avl tree
b-trees
backend communication
backtracking
bellman ford algorithm
byte
cardinality
char array vs pointer
choosing database
compilation steps
compiler vs assembler
consistent hashing
cordon
cpu registers
creating empty arrays
daemon
data lake
depth first search (dfs)
dictionary
dns (domain name system)
docker container
docker image
docker-compose
dockerfile
elixir
elixir process
ephemeral
etl
favorite apps
flip bits
font dump
garbage collector
gcc
git rebase
git reset
healthz
html semantics
https
idempotency
integer vs int
inverted index
js ts parser
jwks
kubelet
kubernetes
kubernetes cluster
language server protocol (lsp)
load balancing
long polling
message queue
minimax
monotonic stack
mtls
multitenancy
node
node.js
nonlocal
one on one tips
osi model
pass by value vs pass by reference
password protected zip
preprocessor
prometheus
proxies
pubsub
rate limiting
replicas vs sharding
server sent events (sse)
sharding vs partitioning
slow fast pointer
socket (python)
sourcemaps
sticky sessions
taints
tcp
tcp vs. udp
tolerations
twos complement
vim buffers
web workers
word
bookmarks
setup
jgoon
/
notes
blog
K
Dark mode
Light mode
minimax
Dec 09, 2024
1 min read
tree where each level alternates returning min and max
applications
game theory
Graph View
Backlinks
No backlinks found