filmov
tv
Find minimum number of coins that make a given value - Coin Change Problem || Dynamic Programming
Показать описание
Find minimum number of coins that make a given value.
Given a value V, if we want to make a change for V cents, and we have an infinite supply of each of C = { C1, C2, .., Cm} valued coins, what is the minimum number of coins to make the change? If it’s not possible to make a change, print -1.
Given a value V, if we want to make a change for V cents, and we have an infinite supply of each of C = { C1, C2, .., Cm} valued coins, what is the minimum number of coins to make the change? If it’s not possible to make a change, print -1.
0:08:38
0:34:15
0:10:22
0:19:23
0:04:31
0:08:33
0:27:13
0:30:36
0:07:09
0:21:56
0:11:59
0:06:25
0:30:30
0:16:33
0:06:43
0:07:17
0:25:54
0:04:16
0:00:59
0:09:15
0:02:57
0:05:03
0:22:38
0:25:28