Published materials
One deck for each class
Open a public PDF snapshot for any completed session. New decks will be exported from the instructor’s course Drive and added here as the course continues.
Introduction
October 3 · Complexity analysis and course overview
Data Structures
October 10 · Vectors, queues, stacks, deques, sets, and maps
Complete Search
October 17 · Brute force, palindromes, and backtracking
Greedy & Dynamic Programming
October 24 · Greedy proofs and dynamic programming
Dynamic Programming & Divide and Conquer
October 31 · Knapsack, merge sort, and binary exponentiation
Combinatorics
November 7 · Binomial coefficients, Catalan numbers, and inclusion–exclusion
Modular Arithmetic
November 14 · Extended Euclid, modular inverse, congruences, and CRT
Strings & Number Theory
November 21 · String hashing, Rabin–Karp, sieves, and modular inverse
Coming next
The course continues in December
There is no class on November 28. Geometry and games are scheduled for December 5, followed by the final “What’s next?” session on December 12. See the complete weekly schedule.