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 https://www.youtube.com/watch?v=lVR2u9lsxl8 See Complete Playlists: Placement Series: https://www.youtube.com/playlist?list=PLdo5W4Nhv31YvlDpJhvOYbM9Ap8UypgEy Data Structures and Algorithms: https: https://www.youtube.com/playlist?list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU Dynamic Programming: https://www.youtube.com/playlist?list=PLdo5W4Nhv31aBrJE1WS4MR9LRfbmZrAQu Operating Systems: //www.youtube.com/playlist?list=PLdo5W4Nhv31a5ucW_S1K3-x6ztBRD-PNa DBMS: https://www.youtube.com/playlist?list=PLdo5W4Nhv31b33kF46f9aFjoJPOkdlsRc Connect & Contact Me: Facebook: https://www.facebook.com/Jennys-Lectures-CSIT-Netjrf-316814368950701/ Quora: https://www.quora.com/profile/Jayanti-Khatri-Lamba Instagram: https://www.instagram.com/jayantikhatrilamba/