Coin Changing Minimum Number of Coins Dynamic programming

muhva tedd krke kaahe bolat h.. but video is good thanks man

How do I fill the first row if I don't have 1 denomination coin? or is this solution requires us to have a coin of denomination of 1?

Thoooooooo = Two -_-

great tutorial

if you are planning to talk about various approaches as asked at other comments, please include complexity discussion as well.

If we don't have $1 bill then what happen in 1st row?

8 plus 1 so 2

Great sir🙏

This logic fails for this input.....
NO OF COINS 3
COINS ARE 8,14,17
SUM 39
EXPECTED OUTPUT 3
OUTPUT WE GET 0

apka room ma light ni ha? 1 bulb hi lga lo nazar kamzoor krni ha?

thxx man it will save me an hour in examination...its jst amazing! truly grateful to you..

denominations [6,8,9] amount 7

what would be the table values? I mean for eg, take ways at index 7, according to the solution we get 1 but in reality how can you give change to 7 using which 1 coin???

Above explained solution does not work for coin array starting with not 1 like [2,5,6,8] and finally if you take min(),...0 is final answer!!!!!!!!!!!!

superb explanation and Thank You Tushar Sir....

The solution won't work if no denominations are possible.

It feels as if I am cramming the solution

@Tushar Roy - You just started with the solution without explaining why ? It's not going to help anyone if we have to memorize it without knowing y.

for Dp, watch ADITYA VERMA DP PLAYLIST

I have watched 4 different types of Money change Dynamic Programming videos, this is so far the best, beating the lecture video from Coursera Algorithm course. If you wanna learn it, watch this first.

Not good explaination for filling the array elements (matrix)

More appropriate title would say " infinite denominations of same coin available"

tot=11
c=[1,5,6,8]
table=[[tot+1 for i in range(tot+1)]for x in range(len(c))]
print(table)
for i in range(tot+1):
table[0][i]=i
for i in range(len(c)):
table[i][0]=0
print(table)
for i in range(1,len(table)):
for j in range(1,len(table[i])):
if(j%c[i]==0):
table[i][j]=table[i][j-c[i]]+1
else:
p=table[i][j-1]+1
q=table[i][j-c[i]]+1
r=table[i-1][j]
print(i,j,"i,j")
print(min(p,q,r))
table[i][j]=min(p,q,r)
# if(table[i][j-1]+1<table[i][j-c[i]<table[i-1][j]):
# table[i][j]=table[i][j-1]+1
# elif:
# table[i][j]=table[i-1][j]

for i in table:
print(i)

Thank you so much tushar. Your explanation is really the best and when I tried to code with your explanation. It was very easy and finally when the output came. Really it builds my confidence that I can also code. Thanks for the video

thanks bro very helpful :)

pain in ear,how u uploased this shit without even checking the sound,i cant watch sorry,buy a microphone then teach

How will the initialization wrok if lets say coins[ ] = {2,4,6} ??? As in this example coins[0] was 1..therefore it worked...
Can anyone explain the initilization part..?

wondering if it really solves the problem by writing the core logic you provided in the video. I tried but it didnt work for me,

I am not sure if we really need 2D Dp. I did in one


memo[0] = 0;
for (int i = 1; i <= amount; i++) {
for (int j = 0; j < coins.length; j++) {
if (i >= coins[j]) {
memo[i] = Math.min(memo[i], 1 + memo[i-coins[j]]);
}
}
}

return memo[amount];

lol i guess i understood everything until the final minute when you ran coding with no pauses

Not very good teaching. Sorry to say

Kindly use good microphone

You are brilliant.. simply elegantly brilliant

Hi , Great video , but can you please tell me why are we taking Integer.MAX_VALUE -1 for intialization in the first row and why not Integer.MAX_VALUE ???

I'm so confused by this

what if the first number is higher than one
ex,: 5

i can asking you if not changing = total how to code ?

Excellent explaination💯💯💯

What about examples where 1 isn't a coin denomination? Then there is no "top" value to use

Language bilkul ni smjh ati apki thoda theek se bol lo

so quick and understanding easy to grasp

Finds min number of coin you will give as a change for example

thank you sm

Nice explanation solved my doubt thank you 💜