Coin Change | Live Coding with Explanation | Leetcode - 322

This video gives the Top-Down DP solution for the question Coin Change leetcode 322

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode

[AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

[udbhasdutta]

Took me a while to understand but it was done really well, thanks!

[keshavgupta]

Can we not use the upper_bound function to get the correct coin then delete that amount from our total amt, inc the count till amt > 0

[BBand]

I would love to do bottom up DP with you

[tusharvatsa]

It should be min(dp[i-1], dp[i-coin] + 1)

[himanshujain]

Where is today's question

13th March
Binary string

[sudhakar]

you are memorizing and explaining the solution. which is bad