In this video, I have explained 0/1 knapsack problem with dynamic programming approach.
Given a bag of a certain capacity, W. Given some items with their weights and profit(values). How do you fill this bag so that you get the maximum profit?


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:   / jennyslecturescsitnetjrf316814368950701  
Quora: https://www.quora.com/profile/Jayanti...
Instagram:   / jayantikhatrilamba