Foundations that stick.
Structured lessons, readable Go solutions, and a test runner that mirrors real interview platforms.
Learning Tracks
Implement encodings, Merkle proofs, UTXO validation, mining, and chain reorganization in Go. Requires byte handling and basic data structures; the capstone combines simplified course components into a node simulator.
Foundations & Encodings
2 problems, 1 quiz
bitcoin encoding varint addressMerkle Trees
1 problem, 1 quiz
bitcoin merkle hashTransactions & UTXO
2 problems, 1 quiz
bitcoin serialization tx utxo +1Script Validation
1 problem, 1 quiz
bitcoin script cryptoProof of Work & Difficulty
2 problems, 1 quiz
bitcoin pow difficulty miningBlock Assembly
1 problem, 1 quiz
bitcoin mempool feesChain Selection & Reorgs
1 problem, 1 quiz
bitcoin consensus reorgCapstone: Bitcoin-Lite Node
1 problem, 1 quiz
bitcoin capstone node
Build six cumulative compiler milestones: expression trees, a BC1 virtual machine, BC2 closures and GC, control flow, linked modules, and a bounded static type checker. Requires Go, recursion, maps, and stack tracing; each module pairs worked artifacts with independent debugging, transfer, and diagnostic review.
Compiler Foundations: Language, Tokens, Grammar
1 quiz
Lexing: From Text to Tokens
1 problem, 1 quiz
compilers lexing tokensParsing & ASTs: Structure Over Text
1 problem, 1 quiz
compilers parsing astLowering: AST to Stack Bytecode
1 problem, 1 quiz
compilers lowering bytecodeLanguage Expansion: Variables, Statements, Functions
1 problem, 1 quiz
compilers lexing strings tokensParsing Programs: Declarations and Statements
1 problem, 1 quiz
compilers parsing ast statementsSemantic Analysis: Names, Scopes, and Rules
1 problem, 1 quiz
compilers semantics scopesBytecode & VM: Making It Run
2 problems, 1 quiz
compilers bytecode lowering virtual machineBytecode Format: A Real Compile Artifact
1 problem, 1 quiz
compilers bytecode serializationCapstone: Source to Bytecode to VM
1 problem, 1 quiz
compilers bytecode vm capstonev3 Language: Collections and Closures
1 problem, 1 quiz
compilers lexing tokens collectionsv3 Parsing: Postfix, Maps, and Arrays
1 problem, 1 quiz
compilers parsing ast collections +1v3 Semantics: Nested Functions
1 problem, 1 quiz
compilers semantics scopes closuresv3 Bytecode: Closures and Indexing
1 problem, 1 quiz
compilers bytecode lowering closuresv3 VM: Closures and GC
1 problem, 1 quiz
compilers virtual machine bytecode gcv3 Bytecode Format (BC2)
1 problem, 1 quiz
compilers bytecode serializationv3 Capstone: Full Pipeline
1 problem, 1 quiz
compilers bytecode vm capstonev4 Control Flow: for, break/continue, && / ||
1 problem, 1 quiz
compilers lexing tokens control flowv4 Parsing: for loops and short-circuit logic
1 problem, 1 quiz
compilers parsing ast control flowv4 Semantics: loop rules and scope
1 problem, 1 quiz
compilers semantics scopes loopsv4 Bytecode: lowering control flow
1 problem, 1 quiz
compilers bytecode lowering control flowv4 Capstone: Full Pipeline
1 problem, 1 quiz
compilers bytecode vm capstonev5 Modules: imports, exports, and a linker mindset
1 problem, 1 quiz
compilers lexing modulesv5 Parsing: modules, imports, and member access
1 problem, 1 quiz
compilers parsing modulesv5 Semantics: import/export resolution
1 problem, 1 quiz
compilers semantics modulesv5 Bytecode: compiling modules
1 problem, 1 quiz
compilers bytecode modulesv5 Linker: merging module bytecode
1 problem, 1 quiz
compilers bytecode linkingv5 Capstone: Full Pipeline
1 problem, 1 quiz
compilers bytecode vm capstonev6 Types: static guarantees for a dynamic VM
1 problem, 1 quiz
compilers lexing typesv6 Parsing: type annotations and signatures
1 problem, 1 quiz
compilers parsing typesv6 Semantics: static types on a dynamic runtime
1 problem, 1 quiz
compilers semantics typesv6 Capstone: Full Pipeline
1 problem, 1 quiz
compilers bytecode vm capstone +1
Build bit streams, Huffman and dictionary codes, transforms, and arithmetic coding in Go, then combine them in a DEFLATE-Lite capstone. Requires bit operations and basic data structures; each exercise specifies its own format.
Compression Foundations & Entropy
2 problems, 1 quiz
compression entropy math prefix-codeBit I/O & Universal Codes
2 problems, 1 quiz
compression bit-io encoding universal-codesHuffman Coding
2 problems, 1 quiz
compression huffman prefix-code encodingDictionary Coding
2 problems, 1 quiz
compression lz77 dictionary lzwTransform Coding
2 problems, 1 quiz
compression transform bwt rleArithmetic / Range Coding
1 problem, 1 quiz
compression arithmetic-coding entropyCapstone: DEFLATE-Lite
1 problem, 1 quiz
compression lz77 huffman
Study threat models, implement hash and cipher components, derive keys, and work through public-key arithmetic in Go. Requires bytes, bit operations, and modular arithmetic; the implementations are learning exercises.
Crypto Foundations & Threat Models
4 problems, 1 quiz
cryptography randomness prng bitwise +5Hash Functions & Merkle Structures
4 problems, 1 quiz
cryptography hashing bitwise merkle-tree +2Block Ciphers & Modes
4 problems, 1 quiz
cryptography block-cipher aes bitwise +5KDFs & Password Hashing
4 problems, 1 quiz
cryptography hashing hmac kdf +4Public-Key Math Essentials
4 problems, 1 quiz
cryptography number-theory gcd modular-arithmetic +2
Implement slotted pages, buffer management, WAL recovery, B+Tree indexes, and transaction locking in Go. Requires basic data structures and byte manipulation; the final simulator combines the storage components.
DB Internals Foundations
1 problem, 1 quiz
database wal serializationPage Layout and Slotted Pages
1 problem, 1 quiz
database storage pagesBuffer Pool and Eviction
1 problem, 1 quiz
database buffer-pool cacheWAL Recovery
1 problem, 1 quiz
database recovery walB+Tree Indexing
6 problems, 3 quizzes
database btree index cost-model +6Transactions and Locking
1 problem, 1 quiz
database transactions lockingCapstone: Mini Storage Engine
1 problem, 1 quiz
database capstone wal
Practice advanced data structures and algorithms in Go or Python, then reason through system-design scenarios. Requires basic complexity analysis, recursion, maps, and queues; use module lessons to connect invariants to implementation.
Arrays & Strings II
8 problems, 1 quiz
array set hash-map two-pointers +10Sorting, Selection & Divide-and-Conquer
2 problems, 1 quiz
divide-and-conquer selection partition merge-sort +1Greedy Fundamentals & Intervals
2 problems, 1 quiz
greedy intervals sorting heap +1Prefix Sums & Binary Search on Answer
3 problems, 1 quiz
prefix-sum hash-map array difference-array +2Monotonic Stack & Queue Patterns
2 problems, 1 quiz
monotonic-stack stack arrayBit Manipulation
6 problems, 1 quiz
bit-manipulation xor array math +3Math & Number Theory Essentials
3 problems, 1 quiz
math gcd lcm modular-arithmetic +3Dynamic Programming Basics
4 problems, 1 quiz
dp math array unbounded-knapsack +1Dynamic Programming Advanced
5 problems, 1 quiz
dp bitmask graph tree +3Strings & Automata
5 problems, 1 quiz
string kmp dp regex +4Suffix Structures & Rolling Hash
1 problem, 1 quiz
string rolling-hash hashingGraph Traversal on Grids
2 problems, 1 quiz
graph dfs bfs gridGraphs Advanced
3 problems, 1 quiz
graph topological-sort cycle-detection shortest-path +1Graphs Beyond Traversal
3 problems, 1 quiz
graph mst union-find scc +3Geometry Basics
3 problems, 1 quiz
geometry orientation line-segment line-sweep +2Probabilistic Data Structures
1 problem, 1 quiz
probabilistic hashingBinary Trees
4 problems, 1 quiz
tree recursion dfs bstHeaps & Priority Queues
3 problems, 1 quiz
heap sorting quickselect hash-map +2Advanced Data Structures
2 problems, 1 quiz
trie strings fenwick binary-indexed-tree +1Advanced Trees
2 problems, 1 quiz
segment-tree range-query array sparse-tableBacktracking
3 problems, 1 quiz
backtracking array recursion constraint-satisfactionUnion-Find (Disjoint Set Union)
3 problems, 1 quiz
union-find graph dfs cycle-detection +1Linked Lists
4 problems, 1 quiz
linked-list recursion two-pointers floyd +2System Design Foundations
1 quiz
System Design Core
1 quiz
System Design Reliability
1 quiz
System Design Capstones
1 quiz
Build Go simulations of ordering, replication, partitions, consensus, storage, and conflict resolution. Requires maps, graphs, and basic concurrency concepts; the exercises use explicit simplified failure models.
Distributed Foundations: Time & Ordering
6 problems, 1 quiz
distributed-systems clocks ordering crdt +2Replication & Quorums
10 problems, 1 quiz
distributed-systems replication quorum availability +9Consistency & Reconciliation
5 problems
distributed-systems consistency ordering replication +1Geo Replication & Multi-Region
1 problem, 1 quiz
distributed-systems replication geoMembership & Failure Detection
3 problems
distributed-systems membership gossip failure-detectionPartitioning & Load
3 problems, 1 quiz
distributed-systems partitioning hashing replication +1Consensus: Raft
9 problems, 1 quiz
distributed-systems consensus raft storage +2Logs & Streaming
8 problems, 1 quiz
distributed-systems streaming logs partitioning +4Observability & Resilience
5 problems
distributed-systems observability sre resilienceCoordination & Transactions
3 problems
distributed-systems transactions coordination consistencyStorage & Durability
4 problems, 1 quiz
distributed-systems storage durability lsmCRDTs & Conflict Resolution
14 problems, 1 quiz
distributed-systems crdt conflict-resolution
Connect scalar autograd, neural-network modules, embeddings, attention, and a small language model through Python lessons and selected exercises. Requires derivatives and matrix shapes; continue with Deep Learning v2 for the cumulative implementation sequence.
Autograd: Building an Automatic Differentiation Engine
3 problems, 1 quiz
autograd computational-graph gradients backpropagation +3Neural Network Abstractions: Module, Linear, Sequential
2 problems, 1 quiz
neural-networks module abstraction linear-layer +1Embeddings and Positional Encoding
1 quiz
Self-Attention: The Heart of Transformers
1 problem, 1 quiz
attention transformers self-attentionThe Transformer Block: Assembling the Pieces
1 quiz
Mini-GPT: Building a Character-Level Language Model
1 problem, 1 quiz
gpt transformers language-models capstone
Build scalar autograd, tokenization, embeddings, bigram and MLP models, attention, and a small transformer in Python. Requires derivatives, matrix shapes, and basic ML loss/optimization concepts; each stage builds toward the language-model capstone.
Autograd: Scalar Reverse-Mode
2 problems, 1 quiz
autograd computational-graph gradients backpropagation +1Neural Network Abstractions
2 problems, 1 quiz
neural-networks module abstraction linear-layer +2Tokenization and Batching
1 problem, 1 quiz
tokenization nlp batchingEmbeddings and Positional Encoding
1 problem, 1 quiz
embeddings positional-encodingBigram Language Model
1 problem, 1 quiz
language-models softmax trainingMLP Language Model
1 problem, 1 quiz
language-models mlp context-windowSelf-Attention
1 problem, 1 quiz
attention transformers self-attentionMulti-Head Attention and Transformer Blocks
1 problem, 1 quiz
transformers multi-head layer-normMini-GPT: End-to-End Language Model
1 problem, 1 quiz
gpt transformers language-models
Use task-based checklists and measurement experiments to investigate algorithm and implementation performance in Go and Python. Best used alongside a working solution; choose the section matching the bottleneck you are investigating.
Explore allocation, safe publication, generics, runtime behavior, bounded workers, and binary framing through Go exercises. Requires working knowledge of Go slices, maps, interfaces, goroutines, and channels.
Go Runtime Performance
2 problems
systems parsing performance allocation +2Go Memory Model and Safe Publication
1 problem, 1 quiz
memory atomic happens-before synchronizationGo Generics Laboratory
1 problem, 1 quiz
generics type-parameters constraintsGo Runtime Internals for Advanced Topics
1 quiz
Go Concurrency Patterns (Deep Dive)
1 problem, 1 quiz
concurrency goroutines channels synchronizationGo Binary Protocols
1 problem, 1 quiz
parsing protocols performance binary
Trace bytes through message types, bitmaps, field encodings, transaction flows, and a Go parser capstone. Requires Go byte/string handling; network-specific exercises use explicitly defined synthetic course profiles.
ISO8583 Foundations & Message Anatomy
3 problems, 1 quiz
iso8583 paymentsBitmaps & Data Element Presence
2 problems, 1 quiz
iso8583 paymentsField Encoding Types
3 problems, 1 quiz
iso8583 paymentsKey Data Elements Deep Dive
3 problems, 1 quiz
iso8583 paymentsTransaction Flows & Message Matching
3 problems, 1 quiz
iso8583 paymentsSecurity - MAC & PIN Blocks
3 problems, 1 quiz
iso8583 paymentsVisa BASE I/II Specifics
2 problems, 1 quiz
iso8583 paymentsCapstone - ISO8583 CLI Parser Tool
1 problem, 1 quiz
iso8583 paymentsAdvanced Challenges
5 problems, 1 quiz
iso8583 payments
Progress from block metadata and free lists to allocation, reuse, realloc, calloc, and allocator integration. Requires C pointers, structs, and byte arithmetic; exercises define a simplified allocator model and its alignment rules.
Memory Fundamentals
1 problem, 1 quiz
memory syscalls heapBlock Metadata Design
1 problem, 1 quiz
memory data-structures pointersFree List Management
1 problem, 1 quiz
memory linked-lists algorithmsBuilding malloc
2 problems, 1 quiz
memory allocation heap deallocation +1malloc with Block Reuse
1 problem, 1 quiz
memory allocation optimizationrealloc and calloc
2 problems, 1 quiz
memory reallocation edge-cases allocation +1Allocator Optimization
4 problems, 1 quiz
memory alignment optimization fragmentation +2Complete malloc Capstone
1 problem, 1 quiz
memory systems capstone
Build ML foundations through Python list implementations: mathematical checks, saved representations, stable classifiers, evaluation, PCA, and XOR. Start with Python and algebra; module readiness guides provide classifier, text, and neural-network routes into DL v2.
Linear Algebra Essentials for ML
1 problem, 1 quiz
linear-algebra vectors matricesCalculus for Machine Learning
1 problem, 1 quiz
calculus gradients derivativesProbability Foundations
1 problem, 1 quiz
probability bayes distributionsDescriptive Statistics
1 problem, 1 quiz
statistics mean variance stdVectors and Distance Metrics
2 problems, 1 quiz
vectors distance similarity classification +1Text Representation: Bag of Words and TF-IDF
2 problems, 1 quiz
nlp text vectorization tfidfEmbeddings: Dense Vector Representations
1 problem, 1 quiz
embeddings similarity nlpLoss Functions: Measuring Model Error
1 problem, 1 quiz
loss mse cross-entropyGradient Descent and Optimization
2 problems, 1 quiz
optimization gradient-descent learning-rate regressionClassification: Decision Boundaries
2 problems, 1 quiz
classification logistic sigmoid softmax +1Model Evaluation Metrics
1 problem, 1 quiz
evaluation accuracy precision recallRegularization and Overfitting
1 problem, 1 quiz
regularization l1 l2 overfittingFeature Engineering
2 problems, 1 quiz
features normalization standardization encoding +1Dimensionality Reduction with PCA
1 problem, 1 quiz
pca dimensionality-reduction eigenvaluesTensors: The Building Blocks of Deep Learning
2 problems, 1 quiz
tensors numpy shapes broadcastingFrom Logistic Regression to Neural Networks
1 problem, 1 quiz
neural-networks backpropagation capstone
Trace processes, scheduling, synchronization, address translation, page replacement, and filesystem storage with Go simulators. Requires basic Go data structures and bit operations; lessons derive the state changes behind each exercise.
OS Foundations and Process Model
1 problem, 1 quiz
os process lifecycleCPU Scheduling
1 problem, 1 quiz
os schedulingSynchronization and Deadlocks
2 problems, 1 quiz
os synchronization deadlock graphMemory Management
2 problems, 1 quiz
os memory paging replacementVirtual Memory: Translation, TLBs, Page Faults, and Copy-on-Write
6 problems, 2 quizzes
os virtual-memory page-tables protection +14Filesystems and Storage
2 problems, 1 quiz
os filesystem inode storage +1
Build deterministic PostgreSQL queries through worked row traces, four implementation exercises, and two reasoning checkpoints. Requires basic SELECT, joins, grouping, and timestamps; teaches windows, as-of snapshots, and bounded recursive CTEs.
Practice 150 Go problems across arrays, trees, graphs, search, and dynamic programming with pattern lessons and checkpoints. Requires basic Go syntax and data structures; reconstruct the reasoning before tackling each module’s problem set.
Array & String
13 problems, 1 quiz
arrays two-pointers in-place counting +2Two Pointers
7 problems, 1 quiz
strings two-pointers arrays sorting +1Sliding Window
7 problems, 1 quiz
arrays sliding-window stringsMatrix
6 problems, 1 quiz
matrix hashing simulation in-placeHash Map
8 problems, 1 quiz
hash-map counting strings arrays +2Intervals
6 problems, 1 quiz
intervals arrays sorting greedy +1Stack + Monotonic
7 problems, 1 quiz
stack strings monotonic parsingLinked List
10 problems, 1 quiz
linked-list two-pointers math merge +2Binary Tree General
10 problems, 1 quiz
binary-tree dfs divide-conquerBinary Tree BFS
5 problems, 1 quiz
binary-tree bfs pointersBinary Search Tree
4 problems, 1 quiz
binary-search-tree dfs inorder stackGraph General
7 problems, 1 quiz
graph dfs bfs grid +4Graph BFS
5 problems, 1 quiz
graph bfs strings gridTrie
4 problems, 1 quiz
trie strings dfs backtrackingBacktracking
7 problems, 1 quiz
backtracking strings gridDivide & Conquer
4 problems, 1 quiz
divide-and-conquer binary-search-tree linked-listBinary Search
7 problems, 1 quiz
binary-search matrix arraysHeap / Priority Queue
5 problems, 1 quiz
heap hashmap arrays data-structure +1Bit Manipulation
6 problems, 1 quiz
bit-manipulation stringsMath
6 problems, 1 quiz
math arrays binary-search hashmap1D DP (Including Kadane)
9 problems, 1 quiz
dp kadane strings binary-search2D DP
7 problems, 1 quiz
dp grid strings