Short description: Challenge problems relating to Topic D.
Relevant notes: Topic D: Greedy Algorithms.
Problems that may combine multiple types of knowledge, incorporate previous topics' material, and/or be more difficult.