0/1 Knapsack Problem easy explanation using Dynamic Programming. | Study Algorithms

preview_player
Показать описание
Dynamic programming is probably the trickiest algorithmic paradigm to master. But that is what makes it essential as well. If you find a hard time understanding the 0/1 Knapsack problem using dynamic programming, this video is made for you. The video tries to explain the problem using a more relatable example from day to day life.

This is a 2 part series.

➡️ Part 1:
Discussion about the general idea of Dynamic Programming and how to generate a Fibonacci Series using DP.

➡️ Part 2:
00:00 - Intro
00:43 - Explanation of the variation of a 0/1 Knapsack problem
02:18 - Why do we call it 0/1?
03:19 - Solving the problem using Dynamic Programming
04:04 - A step by step demo
14:57 - Why is dynamic programming beautiful?

📚 More Algorithmic Paradigms:

💻 Get Social 💻

#studyAlgorithms #programming #interview
Рекомендации по теме
Комментарии
Автор

Great video. I enjoyed dynamic programming for the first time.

nehagoyal
Автор

Tum bada mast kaam krte ho Maqsood bhai.🙏

rohand
Автор

Couldn't be more easier! THANKS MAN!

tulas
Автор

What an explanation. You saved my day. now i got new perspective about dynamic programming. Thanks a lot bro. Keep the good work going

thellaidhinesh
Автор

type at 13:54? When you add the fullness of the soup (400) + the fullness of the remanning 50 calories (100), its suppose to be 500 fullness which Is < 600. You wrote 400 + 100 = 600. which isn't a v big deal. just a heads up.

anushreeyagurung
Автор

why don't we use the previous value from the same row? when we want to calculate the fullness value for 300 calories in a row of Fish we use 300+300=600. why not 300+400=700(400 from same row for 200 calories)?

sidramemon
Автор

wow this was the perfect explanation for me. i count calories so this was super relatable 😊 thank you for the video!

Zashxq
Автор

bhai wahat is fullness
i didnt understand

infinite