What is the purging rule in the knapsack problem?
"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?"