Week 1

• Warm-up problems

Week 2

• Union-find efficient implementation
• Binary search
• Depth first search

Week 3

• Prim's minimum spanning tree algorithm
• Kruskal's minimum spanning tree algorithm
• Topological sorting
• BFS/DFS
• Maximum spanning tree
• Feedback arc set problem

Week 4

• Dijkstra's shortest path algorithm (SSSP)
• Bellmann-Ford shortest path algorithm (SSSP)
• Floyd-Warshall shortest path algorithm (APSP)

Week 5

• Mincut - Maxflow theorem
• Ford-Fulkerson method
• Edmonds-Karp algorithm
• Dinic's algorithm
• Push-relabel algorithm
• Goldberg-Tarjan algorithm

Week 6

• Brute force / Backtracking
• Boolean satisfiability problem
• N-Queens problem
• Sudoku
• Map coloring
• Maximal clique problem

Week 7

• Greedy algorithms
• Approximation algorithms
• Coin change
• Job scheduling
• Approximate 0/1 Knapsack
• Approximate maximum cut
• Fractional knapsack

Week 8

• Dynamic programming
• Coin change
• 0/1 Knapsack
• Longest increasing subsequence
• Box stacking