"How do I solve the following problem: ""How many different ways can you make change for an amount, given a list of coins?"" using dynamic programming?"
How do I solve a change making problem taking at most one coin of one type using dynamic programming?