Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode)

Very nice explanaation

yeah I give up trying to understand and solve this question

amazing how well you teach!! Thanks for great work you do!

Knowing a concept is one thing, but being able to explain it so well is another .Your explanations are lucid and very easy to understad.

Thanks mate you are the best! Very easy to understand!

But why do you use table[row][col-coins[row-1]] when table[row][col-coins] serves the same purpose?

Great video man!!! I loved the way you focussed on making everyone understand the subproblem first rather than just filling the table. Btw does Tushar Roy know he is used like a meme here :P?

One of the most clear and thoughtful explanations on the subject, thank you for spreading your knowledge, you are an excellent prof!

Really love how concise and informative this video is! Instead of getting straight into coding, thank you for drawing out the table and helping us reason through it in a way that actually makes sense and is succinct!

absolute heat

One comment that I was using the algorithm on the Hackerrank preparation kit, each coin in the array must be less or equal to the target amount. Otherwise, the algorithm breaks. Thank you for the clear explaination.

Love your videos! Very easy to understand! Thank you!

Nah, not clear at all.

You have made these problems soooooo easy to understand!!!

great video

Best explanation. Clear, concise. Thanks 👍

This explaination is damn genius! Love it!

I love how you explain this problem and the use of the disclaimer "do not memorize the patter, memorize the subproblem". Your order of explanation, repetition, knowledge of the subject, the thoroughness of your explanation and your enthusiasm are amazing! Thank you for creating this!

Thanks for the video !! it really helped

THIS IS THE BEST DP PROBLEM EXPLANATION EVER. THANKS!

God bless you for this clear explanation I was struggling for hours

thank you. this video made everything clear for me

Tushar Cameo though haha...

thx bro! you've helped me a lot! I was struggling to understand this problem quite a long time. Goood work!

Every single dynamic programming video should write out the underlying recurrence relation

I might be missing something obvious but why does coin change need a dp[] and coin change 2 need a dp[][]. How do we determine when we need a 1D array vs a 2D array.

You are a fabulous teacher, crystal clear, thank you so much!

Why would you put 1 for emptyvarray? That is voodoo black Magic trial and error
I started with recursion memorization and looked at the numbers generated by that and tried to put relation. It dies not work unless you put 1 for empty array situational and when it works we comevup with some explanation as to why 1 shod be there for nothing. If 0 had worked foempty we could justify that also

You are the GOAT

Got the algo concept in ur video after failed attempts in understanding the same in two different videos.That said, u r clearer to me

listening to the words of a wise man can be superior to studying ten years of books
聽君一席話，勝讀十年書。

thanks for the explanation

very well explained 👍

Thanks for the nice explanation 💯

Hi Benyam! I love your videos, I've been watching all of your dynamic programming problems! Thank you for the wonderful content.

However I do have a question, in this example you chose the number of ways we can make change using [1],[1,2] and [1,2,5] coins. But what is stopping using from using any other combination such as [1,5] or [2,5] or just [5] or just[2]. Are they already being covered somehow? Can I choose any three combinations?

Hi bro can you code in Java or Java 8

I struggle to understand iterative approaches towards dp problems. your video was great help! thanks ben!

This is good. I believe it is also helpful for solving the different ways to represent N as a sum of K non-zero integers.

Alpha male explanation

I needed to watch this video like over and over and over and read about dynamic programming again.

Am I like the only one who thinks this is totally stupid? I understand 2nd grad mathematics but not dynamic programming

God bless this man for his videos

could someone explain why we don't need to use a 2d array for finding total ways that don't need to be unique, so 1+1+2 and 1+2+1 are counted differently

But if 2 + 1 and 1 + 2 are different ways. Your solution doesn't work (

Wow ! finally someone explained how the tabular method works. Thanks :)<3

THE BEST explanation I've seen ! Awesome !

¥€$