| 2019-08-26 |
Course Introduction |
| 2019-08-28 |
IO |
| 2019-08-30 |
Ad Hoc Simulation |
| 2019-09-04 |
Arrays and Vectors |
| 2019-09-06 |
Stacks and Queues |
| 2019-09-09 |
Balanced BSTs and Heaps |
| 2019-09-11 |
Basic Graphs |
| 2019-09-13 |
Union Find |
| 2019-09-16 |
Segment Trees |
| 2019-09-18 |
Fenwick Trees |
| 2019-09-20 |
Traversals |
| 2019-09-23 |
Complete Search |
| 2019-09-25 |
Divide and Conquer |
| 2019-09-27 |
Greedy Algorithms |
| 2019-09-30 |
Dynamic Programming 1 |
| 2019-10-02 |
Graphs 2 |
| 2019-10-04 |
Graphs 3 |
| 2019-10-09 |
Minimum Spanning Tree |
| 2019-10-11 |
Single Source Shortest Path |
| 2019-10-16 |
All Pairs Shortest Path |
| 2019-10-18 |
Network Flow |
| 2019-10-21 |
Combinatorics - Fibonacci, Binomial, Catalan |
| 2019-10-23 |
Prime Numbers |
| 2019-10-25 |
GCD |
| 2019-10-28 |
Games |
| 2019-10-30 |
Contest Strategy |
| 2019-11-01 |
String Matching |
| 2019-11-04 |
Strings and Dynamic Programming |
| 2019-11-06 |
Suffix Trees |
| 2019-11-11 |
Points, Lines, and Vectors |
| 2019-11-13 |
Shapes |
| 2019-11-15 |
Convex Hull |
| 2019-11-18 |
The Bitmask Technique |
| 2019-11-20 |
State-Space Search (and Meet in the Middle) |
| 2019-11-22 |
A* Search |
| 2019-12-02 |
Advanced Dynamic Programming |
| 2019-12-04 |
Problem Decomposition |
| 2019-12-06 |
2-SAT Problem |
| 2019-12-09 |
Travelling Salesperson |
| 2019-12-11 |
Simultaneous Linear Equations |