0/1 knapsack problem-Dynamic Programming | Data structures and algorithms

🔥 Jenny's lectures Placement Oriented DSA with Java course (New Batch):
https://www.jennyslectures.com/courses/Mastering-DSA-with-JAVA-2-68ce8b083425e77d71739441

⚡ Limited seats! First 500 students get an extra 20% OFF with coupon: BEST500

Jenny's Lectures JAVA from Scratch Course: https://www.jennyslectures.com/courses/Java-From-Scratch-67c9a7244b2225248cf88385

GenAI Course for beginners: https://www.jennyslectures.com/courses/Generative-AI-for-Beginners-From-Basics-to-Chatbot-Creation-68584c28a81c363f9f037df1

**************************************
Connect & Contact Me:

Facebook: https://www.facebook.com/Jennys-Lectures-CSIT-Netjrf-316814368950701/
LinkedIn: https://www.linkedin.com/in/jayanti-khatri-32653817/
Instagram: https://www.instagram.com/jayantikhatrilamba/
Twitter: https://twitter.com/KhatriJenny

*****************************************

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: 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

Видео 0/1 knapsack problem-Dynamic Programming | Data structures and algorithms канала Jenny's Lectures CS IT