| Num. | Topics | Files |
| 1 | Introduction and reductions | Notes |
| 2 | Reductions | Notes |
| 3 | Greedy Algorithms | Notes |
| 4 | Greedy Algorithms | Notes |
| 5 | Minimum Spanning Tree | Notes |
| 6 | Minimum Spanning Tree | Notes |
| 7 | Dynamic programming | Notes |
| 8 | Dynamic programming | Notes |
| 9 | Dynamic programming | Notes |
| 10 | Shortest paths | Notes |
| 11 | Shortest paths | Notes |
| 12 | Shortest paths | Notes |
| 13 | Maximum flow problem | Notes |
| 14 | Maximum flow problem | Notes |
| 15 | Maximum flow problem | Notes |
| 16 | Maximum flow problem | Notes |
| 17 | Linear programming | Notes |
| 18 | Linear programming | Notes |
| 19 | Linear programming | Notes |
| 20 | Randomized algorithms | Notes |
| 21 | Randomized algorithms | Notes |
| 22 | Chernoff bounds and approximation algorithms | Notes |
| 23 | Approximation algorithms | Notes |
| 24 | Approximation algorithms | Notes |
| 25 | Approximation algorithms | Notes |