9/7 - Getting Started
9/12 - Stable Matching (steps 1 and 2)
9/14 - Stable Matching & Proof workshop
9/19 - Asymptotics
9/21 - Asymptotics (continued)
9/26 - Graphs (traversals)
9/28 - Graphs (bipartite)
10/3 - Graphs (directed)
10/5 - Graphs (directed)
10/12 - Greedy algorithms (shortest paths)
10/17 - Greedy algorithms (MST)
10/19 - Greedy algorithms (interval problems)
10/24 - Dynamic Programming (foundations)
10/26 - Dynamic Programming (knapsack)
