Overview of optimization problems (Tony)
 - Discrete problems
    - 0/1 knapsack
    - Shortest paths
    - Maximum bipartite matching
 - Continuous problems
    - Least squares regression
    - Neural network training

 Ask how they feel about greedy vs. enumerative vs. DP? (Jaclyn)
 - When can you use greedy?
 - Why use enumeration?
 - Why DP?

Dynamic programming review (Tony)
 - Ask - do you understand knapsack DP?
 - Understand difference between memoization vs. tabular? Advantage of one or the other?
 - What is optimal substructure?
 - Memoization
    - What is memoization?
    - Review knapsack memo from lecture

 - Tabulation
    - What is tabulation?
    - Review knapsack tabular from lecture

Shortest string edit distance exercise with both memoization + tabulation method (Jaclyn)
- Memoization exercise
- Tabular exercise
