A reference list of the most common patterns in DS&A problems, including hashmaps, two pointers, DFS/BFS, dynamic programming, and more. Useful for interviews, practice, or competitive programming prep.
Common pitfalls and misconceptions about distributed systems topics like CAP, ACID, quorum math, and leaderless replication—designed for quick interview prep.
Handy Python snippets and patterns for working with 2D grids and matrices: initialization, bounds checking, neighbor offsets, and n-distance neighbors.