Coin Changing Minimum Number of Coins Dynamic programming

Video quality	The size	Download

Information Coin Changing Minimum Number of Coins Dynamic programming

Title	:	Coin Changing Minimum Number of Coins Dynamic programming
Lasting	:	8.33
Date of publication	:
Views	:	453 rb

what if the first number is higher than onebrex,: 5
Comment from : JAN_ek_

4:33 let's come to s*x
Comment from : Akash Nai

I'm so confused by this
Comment from : Falling Star

Hi , Great video , but can you please tell me why are we taking IntegerMAX_VALUE -1 for intialization in the first row and why not IntegerMAX_VALUE ???
Comment from : Vasanthan V

You are brilliant simply elegantly brilliant
Comment from : Qwarlock

3:16 why go back coin value steps back? Why does this work?
Comment from : John Hammer

Kindly use good microphone
Comment from : shubro chakroborty

Not very good teaching Sorry to say
Comment from : darth vàdar

lol i guess i understood everything until the final minute when you ran coding with no pauses
Comment from : Allan Magalhães

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,
Comment from : Sheenam Jindal

thanks bro very helpful :)
Comment from : Mohammed Safwan

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
Comment from : Sharon Binto

More appropriate title would say " infinite denominations of same coin available"
Comment from : Cristiano Uzumaki

Not good explaination for filling the array elements (matrix)
Comment from : Buzz Feed Red

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
Comment from : Shell Lu

for Dp, watch ADITYA VERMA DP PLAYLIST
Comment from : Shashank Rustagi

@ 3:00 i didn't get it 100 Can someone explain?
Comment from : Alex Stoubis

@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
Comment from : Kitty Jain

It feels as if I am cramming the solution
Comment from : Rahul Dev Gupta

The solution won't work if no denominations are possible
Comment from : Shobhit Ranjan

superb explanation and Thank You Tushar Sir
Comment from : Tushar Singh

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!!!!!!!!!!!!
Comment from : sanaka chiranjeevieuro

denominations [6,8,9] amount 7brbrwhat 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???
Comment from : Pranay Sanam

thxx man it will save me an hour in examinationits jst amazing! truly grateful to you
Comment from : Rahil Thakkar

apka room ma light ni ha? 1 bulb hi lga lo nazar kamzoor krni ha?
Comment from : Ehtisham Shami

This logic fails for this inputbrNO OF COINS 3brCOINS ARE 8,14,17brSUM 39brEXPECTED OUTPUT 3brOUTPUT WE GET 0
Comment from : sankeerth meda

Great sir🙏
Comment from : Riyank Patel

thanks alot
Comment from : Real Guru

8 plus 1 so 2
Comment from : Mahmudul Hasan

if you are planning to talk about various approaches as asked at other comments, please include complexity discussion as well
Comment from : Santhosh Ramanan R

great tutorial
Comment from : Sainath Tallam

Python Solution:br idegeeksforgeeksorg/aFiP62RnlK
Comment from : Nikhil Singh

youtube/C8bmCYohJkwbr youtube/7pRO5Zuiijo
Comment from : Amit Kumar

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?
Comment from : Tejasvi Gupta

muhva tedd krke kaahe bolat h but video is good thanks man
Comment from : Anurag chaudhary

You got column and rows reversed, it is a bit confusing
Comment from : Miguel Carvajal

He says "yes we will use dynamic programming" and directly jumps to fill the table out of nowhere That's why I could never learn anything from him A bad technique to teach DP The first and foremost step must be finding the recursive solution I don't know why a lot of people out there recommend Tushar's video I tried to watch his videos with a fresh mind but every time I felt let down Sorry, but I cannot say "awesome tutorial" if I didn't learn anything This is the last attempt I'm here
Comment from : Manoj Pandey IITG

Good explanation sir, thank you
Comment from : Ramesh Velusamy

Worst tutorial ever It looks like he has memorized the algorithm and vomiting herebrHe didn't talk about recursion a bit just started building a table without even saying that it's a 2D DP question
Comment from : SOURAV SIKARIA

@tushar Roy what if our coins arent in sorted ordder?
Comment from : Durgesh Mishra

Thanks a lot its very helpful
Comment from : hari krishna

if there isn't $1 coin this wouldn't work right?
Comment from : DONGYU CHEN

So much better explained than AlgoExpert
Comment from : Danyal Isran

Looks like the video was made in quite a hurry
Comment from : Boston Lights

Can't we solve this using window replacing
Comment from : HA MI Cartoon

how to build the auxiliary storage - using the same example as in the video : mediumcom/@anjugopinath/coin-change-minimum-number-of-coins-dynamic-programming-solution-264191815640
Comment from : Anju Gopinath

I have Created Blog of must do Dynamic Problems which will help you for interview & notesbrbrIf you will see simultaneously videos of tushar roy than absolutely you will get all concepts clearbrbrVisit link :brbrDynamic Problem Must do questions blog
Comment from : Huzaifa Shaikh

You explain very nicely!!brThank you!!
Comment from : Sushil Jaiswal

You never explained why this logic is working And why we are going for DP and what dp approach we are using
Comment from : Nishank Soni

Am I missing something? br1 This solution seems to work only for coins with 1 in it [2,3,5] & 11 won't workbr2 Github link has a different solution in it
Comment from : Boosan M

how to check here if the total sum is possible or not using denominations?
Comment from : Anshuman Srivastava

The reason he doesn't know how he got to the solution is that it's not his solution This is just a plagiarist of which, as you can tell, there is nothing to be learned
Comment from : Alex B

githubcom/mission-peace/interview/blob/master/src/com/interview/dynamic/CoinChangingMinimumCoinjava
Comment from : Abhishek Kumar

what if the number of coins are limited? can anyone explain me? or give me a link to another video?
Comment from : Rian Channel

This can be done by using one dimensional array
Comment from : Durgesh Kumar

nice video gautam gambhir
Comment from : Sri Krishna Sahoo

What a bizarre explanation How did you come up with the formula? Please try to explain that also
Comment from : Hamiz Ahmed

Worst tutorial I have ever seen He is just telling us how the table is formed and he assumes we know why, good way to pass your time tushar
Comment from : Pritish Mishra

why are we going 5 steps back and adding 1??what is the logic??
Comment from : Rohit Kishore - Piano Covers 🎹🎶

What if we weren't given the coin 1 ?
Comment from : Sadman Sakib

Excelent
Comment from : S

your videos are really helping alot but your spoken english hurts at many places
Comment from : parag AANAND

Thank you so much!
Comment from : Jonathan Long

can you explain intuition behind the solution??
Comment from : Pac Man

abe harami light laga na
Comment from : Anirudha Talmale

dear sir it would be helpful If you explain the problem with code also As it is very difficult to code, although conceptually it is easybrI was looking for an explaination like your trees playlist
Comment from : J G

in every video you just explain the solution but not the approach to the solution or in other words no emphasize on thought process
Comment from : Himanshu sharma

first u become indian or american dont try to be both u just turn out to be none haha
Comment from : Richa Varghis

Awesome video!!
Comment from : Pragati Tanwar

please don't tell the formulae for dp questions, start how is this helping solving the question But a nice tutorial Thanks
Comment from : Vartika Sharma