Easy Problemscountingsubset
Coin change problem – Count Ways
Given coin denominations and a target sum, with an unlimited supply of each denomination, count the distinct combinations of coins that add up to the target. Two combinations that use the same coins in a different order are not counted separately.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.