DP#2: Coin Change Problem Number of ways to get total | Dynamic Programming | Algorithms

Correction: @16:20 in coin 5 and weight 6 intersection it should be 2, at coin 5 and weight 11 intersection it should be 4, at coin 10 and weight 6 intersection it should be 2, in coin 10 and weight 11 intersection it should be 4

This video talks about coin change problem using dynamic programming with example. Given infinite supply of coins of different denominations and certain amount. how many ways these coins can be combined to get the given amount.

What is Dynamic Programming | How to use it

See Complete Playlists:

Connect & Contact Me:

[JennyslecturesCSIT]

CORRECTION: @16:20 in coin 5 and weight 6 intersection it should be 2, at coin 5 and weight 11 intersection it should be 4, at coin 10 and weight 6 intersection it should be 2, in coin 10 and weight 11 intersection it should be 4.


I hope you guys got this correction. :)

[ihsandag]

I have never seen a more clear explanation for this popular problem. I'd wish to have all my instructors like you back in time. Now I stand and clap this great instructor. Thanks!!!

[MiddleEasternInAmerica]

Thank you so much Jenny, much love and respect for you and all Indians from Egypt

[antaratewary]

please make a complete series on dynamic programming.I have scourged the internet, and you are by far the best.Please help students in understanding such concepts.Thank you so much.

[alixaprodev]

12:52 when you are saying fine. This is the best style i have ever seen. just enjoying your way of teaching.

[HeyItsVishal]

i wish hamare yaha itni achi teacher hoti you are great

[ramziadil]

You are the best! You explained this so clearly! It was so helpful that you explained what the rows, columns, and what each cell represented as well as the strategy for calculating the values. I was so confused when my professor lectured about it, but in so little time, I learned a lot from you! THANKS SO MUCH!!

[pallavipriya]

Your code will give a segmentation fault when i==0 as it is accessing i-1
Explanation is really nice. Thanks.

Correct code :
for(int i=0;i<m;i++)
table[i][0]=1;

for(int i=0;i<m;i++)
{
for(int j=1;j<=n;j++)
{
if(coin[i]>j)


else


}
}

[nandhakumarkr]

Thank you for explaining the great tricking dynamic programming to all. Your explanation made it easy . Kudos great work 🎉

[bharatkumarshukla]

Ma'am thank you so much your lecture really helped me understand the algorithm behind this problem. Though I was able to implement the algorithm I still have one doubt as to what was the logic behind including the coin step? Though I was able to implement it but couldn't understand it very well. Thanks.

[rushabhsinhsolanki]

You and your way of teaching are just Awesome...
Great Explanation....
Thanks for

[vasugupta]

I think DSA (specifically DP) is the only part in coding where most of IT professionals lack skills to code because most of the teachers aren't able to explain clearly, but through your videos, you can help every young IT professional to understand these concepts better

[adityaprasadsahu]

Hats off to you mam, literally you are far far better teaching from our college professor to whom we are paying lakhs of rupees.
Bow down for your deliberate teaching and the way you are teaching.
If this kinda teaching we gonna get we will definitely fall in love with DSA/DAA.

[陳寬-xd]

Thank you very much. Your lectures are best and really save my algorithms course at university. Without your lectures, I will probably fail my course. Can you pls make vedios on backtracking algorithms and related problems like N-queens and Sudoku in the future?

Thank you for your great lectures:)

[bajracha]

Thanks for such a clear explanation and detail walk through of the problem.

[allamtajusarof]

very clear, no hesitation, really understandable. love this lecture... thank you for creating a great videos. 🧡🧡

[harshitprose]

finally i found a grt vedio with some good explanation .

[maverickhackers]

Thank you so much mam, i watched this video in almost four channels but i wasnt able to get a proper idea about how to proceed but your explanation made it very easy for me to understand

[asifking]

Thank you mam and for those who are saying they didn't get this explanation try to concentrate on board more...everything here is crystal clear ❤️❤️

[reshyasudhiv]

Super mam..I I'll become a best professor award in my college ..really you I'll helping me a lot.. very much big fan of your work..thank you once again mam..