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
   • DP-1: What is Dynamic Programming | H...  

See Complete Playlists:

Placement Series:    • Placements Series  

Data Structures and Algorithms: https:    • Data Structures and Algorithms  

Dynamic Programming:    • Dynamic Programming  

Operating Systems: //   • Operating Systems  

DBMS:    • DBMS (Database Management System)  


Connect & Contact Me:

Facebook:   / jennys-lectures-csit-netjrf-316814368950701  
Quora: https://www.quora.com/profile/Jayanti...
Instagram:   / jayantikhatrilamba