You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
notes/classes/algorithms/change_making_problem.md

640 B

change making problem

problem: Return coins or bills in change for a non negative amount n

for this exorsise, we have denominations at

3,4,&7

val coins
1
2
3 1
4 1
5
6 2 (3&3)
7 1
8 2 (4&4)

t The way that this is calculated is by finding the min between the index minus each of the denominations (i.e in this example we would be searching back 3,4 & 7 units respectively) and then adding 1.

see also

list without id file.inlinks
where file.name = this.file.name