Dynamic Programming

• Keep a set of notes and examples.
• Work on some problems, and attemtp to visualize these problems.

• Coin Sums: Given a set of coins in a currency S, and a value n, how many way can the n be achieved using only conis from S?.

  This was inspired by a Project Euler problem.