Maximum Sum (dADS1 hand-in week 1).
The Skyline Problem (dADS2 hand-in week 1).
Arbitrage, Arbitrage (II) (CLRS Problem 24.3, shortest paths, Bellman-Ford, negative weight cycle).
Stacking Boxes (CLRS problem 24.2, graph theory, DAG, longest path, sorting).Longest Paths (CLRS Ex. 24.2-3, DAG, longest paths).
Bicoloring (CLRS Ex. 22.2-6, BFS, DFS, 2-coloring, cycles of odd length).
Minimal Coverage (CLRS Ex. 16.2-5, similar, greedy).
Rare Order (graph theory, DAG, topological sorting).
Crimewave (CLRS Problem 26-1, maximum flow, vertex capacities)
Andy's Shoes (dADS1, solving puzzles, permutations, see this note)