- Warm-up problems
- Union-find efficient implementation
- Binary search
- Depth first search
- Prim's minimum spanning tree algorithm
- Kruskal's minimum spanning tree algorithm
- Topological sorting
- BFS/DFS
- Maximum spanning tree
- Feedback arc set problem
- Dijkstra's shortest path algorithm (SSSP)
- Bellmann-Ford shortest path algorithm (SSSP)
- Floyd-Warshall shortest path algorithm (APSP)
- Mincut - Maxflow theorem
- Ford-Fulkerson method
- Edmonds-Karp algorithm
- Dinic's algorithm
- Push-relabel algorithm
- Goldberg-Tarjan algorithm
- Brute force / Backtracking
- Boolean satisfiability problem
- N-Queens problem
- Sudoku
- Map coloring
- Maximal clique problem
- Greedy algorithms
- Approximation algorithms
- Coin change
- Job scheduling
- Approximate 0/1 Knapsack
- Approximate maximum cut
- Fractional knapsack
- Dynamic programming
- Coin change
- 0/1 Knapsack
- Longest increasing subsequence
- Box stacking