Page 4 · Showing 3 of 27 posts
View yearly archives →
-
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.
27 min read English -
Sieve Methods Beyond Primes: A Unified View of Linear SieveBased on original number theory notes, covering prime sieves, Euler's totient function, and Wilson's theorem.
7 min read English -
From Divisibility to Congruence: Number Theory BasicsBased on original number theory notes, covering gcd, lcm, Bezout, exgcd, fast power, modular inverse, and CRT.
5 min read English