Write recursive DP without thinking about memoization
A C++ template for recursive DP with automatic memoization, built from recursive lambdas, generalized hashing, and policy-based hash tables.
An elementary way of solving recurrences
An elementary way to solve recurrences by changing variables until simpler structure appears, recovering characteristic-equation intuition without heavy machinery.
The Akra-Bazzi theorem - a generalization of the master theorem for recurrences
A practical introduction to the Akra-Bazzi theorem as a way to analyze divide-and-conquer recurrences with unequal splits, floors, and offsets.
On lambdas, C++ and otherwise: the what, the why, and the how
A tutorial on lambdas, from lambda-calculus context and C++ closure mechanics to recursion, stateful patterns, STL use, and competitive-programming examples.
A practical theoretically faster variant of the Euclidean GCD algorithm
A note on a Euclidean GCD variant that greedily reduces the remainder, with benchmarks and an iteration-count improvement.
Avoiding temporaries - generalizing i++ using std::exchange
A discussion and generalization of post-increment through std::exchange, with examples in recurrences, GCD code, lazy updates, moves, locks, and iterators.
The Boost C++ library in competitive programming
The Boost C++ library and examples of what it would give competitive programmers beyond the standard library.
PSA: Increase your stack size before the Meta Hacker Cup, here's how
A short PSA on increasing stack limits before MHC, with commands, compiler flags, and platform caveats.
The Floyd-Warshall algorithm and its generalizations
A tour of Floyd-Warshall as an instance of aggregating over graph paths, leading to transitive closure, Kleene algebras, and the algebraic path problem.
User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)
A user-written editorial for Codeforces Round 513, which did not have an editorial before.