- Course Introduction
- Quick Introduction to Runtime Analysis and big-O notation
- Quick Introduction to C++ for Competitive Programmers
- Introduction Quiz
- Introduction to Graphs (Terms and Representation)
- The Depth-First-Search
- The Breadth-First-Search
- Topological Sorting
- Graph Search Quiz
- Dijkstra's Algorithm - Part 1: Understand
- Dijkstra's Algorithm - Part 2: Analyse
- Dijkstra's Algorithm - Part 3: Implement
- Dijkstra's Algorithm Quiz
- Negative Edges: Bellman-Ford Algorithm
- All Distances: Floyd-Warshall Algorithm
- Shortest Paths Quiz
- From Recursion to Memorization to Dynamic Programming
- The Knapsack Problem
- Dynamic Programming on Trees
- Dynamic Programming Quiz