-
Java Abstract Boundaries: Collections, IO, Reflection, Proxy, and SPIBased on original Java notes, preserving the original organization of Collections, IO, Reflection, Proxy, and SPI.
101 min read English -
How Operating Systems Hold Up Programs: Processes, Memory, Files, and I/OA practical review of operating systems: processes, threads, virtual memory, page cache, system calls, file systems, and I/O.
24 min read English -
From Browser to Server: Which Network Layers a Request CrossesDon't reduce computer networks to a list of protocol names. Follow a real request and see how DNS, TCP, TLS, HTTP, and congestion control work together.
26 min read English -
Why Polynomial Algorithms Matter in Competitive ProgrammingFrom convolution, point-value representation, FFT/NTT to formal power series - understanding what this polynomial toolkit is really solving.
17 min read English -
From Convolution to Inversion: What Mobius Inversion DoesBased on original number theory notes, covering Dirichlet convolution, Möbius function, inversion techniques, and common identities.
9 min read English -
My Intro to Generating Functions: Let Coefficients Be AnswersBuilt from the original notes, restoring ordinary generating functions, exponential generating functions, modeling intuition, and several typical problems.
12 min read English -
A Framework for Judging Game Theory in ContestsBased on original game theory notes, supplementing the judgment framework, Bash/Nim, Misere games, Fibonacci game, Wythoff's game, and SG function.
13 min read English -
Search Is Not Brute Force: DFS, BFS, and DPBuilt from original search problem sets and solution notes, organizing DFS, BFS, pruning, shortest paths, and state-space search.
28 min read English
Blog
Page 3 · Showing 8 of 26 posts
View yearly archives →