title: Determine if you can make change with N denominations using each denomination only once and with at most k coins
body: <p>This is a version of the coin-changing problem. As such, it is a dynamic programming problem.</p>
  
  <p>I know how to determine if you can make change if either you can use at most one coin of each denomination or if you can use at most k coins, but not both.</p>