Python Data Structures & Algorithmic Complexity Cheat Sheet
Big-O time/space complexity, collections module, heap/bisect idioms, and amortized analysis.
Distilled equations, Big-O complexity matrices, production code templates, and architecture trade-offs. View interactively or download auto-generated PDF and Standalone HTML reference sheets.
Big-O time/space complexity, collections module, heap/bisect idioms, and amortized analysis.
Latency numbers, consistent hashing, CAP/PACELC theorems, sharding, and back-of-the-envelope capacity math.
Scaled dot-product attention, Multi-Query / Grouped-Query Attention (GQA), RoPE, FlashAttention, and VRAM sizing.
0/1 & Unbounded Knapsack, LCS/Edit Distance, Interval DP, Bitmask DP, and space-reduction templates.
ROW_NUMBER vs RANK, frame clauses (ROWS vs RANGE), B-Tree composite index selectivity, and EXPLAIN ANALYZE.
Shortest-path selection matrix, Kahn's topological sort, Disjoint Set Union (DSU), and Tarjan's SCC.
Control plane components, QoS eviction classes, readiness/liveness probes, HPA math, and network policies.
Leader election safety, log replication invariants, split-vote randomized timeouts, and linearizable reads.
React Server Components wire format, Suspense streaming boundaries, Server Actions, and CSP nonce propagation.
Spectral Theorem, Singular Value Decomposition (SVD), PCA, LoRA low-rank adaptation, and Jacobian/Hessian identities.
Authorization Code + PKCE flow, JWT signature verification, Strict-Dynamic CSP nonces, and CSRF/XSS mitigation.
Blobs, trees, commits, rebase vs merge, interactive bisect, reflog recovery, and immutable artifact pipelines.
Enter any prompt, syllabus, or research topic—Lesson 1.1 streams in under 45 seconds while Manim animations and slides render automatically.