Название | : | 4.5 0/1 Knapsack - Two Methods - Dynamic Programming |
Продолжительность | : | 28.24 |
Дата публикации | : | |
Просмотров | : | 2,1 jt |
|
Thank you sir Comment from : Henry Chiemezie Paul |
|
explained it better than my professor, i don't know why im paying for college Comment from : Ceo of Nothing |
|
This guy is a goat Comment from : Younes Slaoui |
|
why youtube has the best faculties ??? and colleges don't OUR EDUCATION SYSTEM NEEDS SUCH TEACHERS Comment from : Charul Patel |
|
sir samj nhi aya Comment from : Añonymoús (-_+) |
|
Sir what if 2 weights are given samewhich first to be considered while arranging in ascending order? Comment from : frëqüënçy |
|
programmatically speaking the computer does not skip cells, in your explanation you keep skipping cells Comment from : HigherLow1000 |
|
You explain it in such a clear and simple way, finally i understand it, thank you very much! Comment from : fred flintstone |
|
superb next level explaination Comment from : Akshay Patel |
|
amazing explanation thx! Comment from : amir barjakli |
|
Jazakallah khair Bahut aasani me samjh aya Comment from : Allahs virtue |
|
Thank you soo much Sir😄 Comment from : Varsha Ravishankar |
|
Hey guys brbrI haven't watched the playlist yet but can someone confirm if sir has explained code as well for all the algorithms? Comment from : Nikitha Nikki |
|
😵 Comment from : wid |
|
Binary tree starting from 8 will get 8 with both permutations of(5,3), if you eliminate any branches that reuse any weight No hopping around a table Looking into what changes between recursions Looks to be ripe for memoization Comment from : Par Machine |
|
very great explanation sir, really you make complex problems done in a simple and easy way thank you so much for sharing knowledge Comment from : Shahzor Ahmed |
|
what if the weight of objects were not integers? Comment from : Maria Diaz |
|
Jai shree ram 🚩 Comment from : Abhishek gowda |
|
This guy is a legend Comment from : Maxime Clavel |
|
You are amazing! Comment from : Redfax201 |
|
Bhai this is the best explanation ever😭 Comment from : Harshita |
|
wasn't easy to understand Comment from : Pranjal Raj |
|
Thank you Abdul, this was very easy to understand Comment from : Alan Balderas Sánchez |
|
Thank you so much sir!!!! Comment from : winestring |
|
What an amazing way of teaching🎉❤ Comment from : Aman Jha |
|
Your teaching skills are so awesome sir🙏👏👏👏👏👏 Comment from : 𝓛𝓮𝓰𝓮𝓷𝓭𝓖𝓪𝓶𝓲𝓷𝓰 |
|
Perfect lesson! So well paced and comprehensive Comment from : Gretgor |
|
SET METHOD- 19:26brTABLE METHOD - 0:00 Comment from : Abhilasha Garg |
|
What if the weight is 40 Comment from : dan L |
|
you are heaven sent - i got it after watching the first 10 minutes, i love your videos, the are super helpful Comment from : Anna Sidor |
|
You are God Of Algorithms sirTake my Humble Regard🙏🙏🙏🙏🙏🙏🙏🙏🙏 Comment from : Nishant Kumar |
|
Thank you very much Very well explained Comment from : MSMOSCOW |
|
You are born to teach complex concepts in a simple way Bunch of thanks sir❤❤💫 Comment from : Dinusha Chathuranga |
|
how can we identify weight? Comment from : Lexy |
|
Sir unga udamba vachey marachikuringa 😮💨 Comment from : Hari Priyan |
|
You are awesome abdul sirrr!!, Lots of love to you:) Comment from : The Ganesh show |
|
गुरू ब्रह्मा गुरू विष्णु, गुरु देवो महेश्वरा गुरु साक्षात परब्रह्म, तस्मै श्री गुरुवे नमःbrbr🙏🚩🚩🙏brइम्तिहान में सर्वदा अवल व बेहतर अंक आए 🙏🙏🚩🚩🛕🛕💐💐🪔🪔🌞🌞😊😊🕉️🕉️🕉️🛕🛕🚩🚩🙏🙏🌹🌹🌷🌷⛳⛳😃😃🇮🇳🇮🇳👏👏🦚🦚 Comment from : AMIT KUMAR CHOUBEY |
|
i wanna cry Comment from : Mehmet Nadi |
|
Mr Bari: Thank you so much I was struggling to understand this problem and was not able to find an explanation as clear as this Thank you so much again Comment from : Ahmet Laçin |
|
thankyou, uncle bari! Comment from : MUHAMMAD RAHARDIAN |
|
you are the best amazing Comment from : Vishrut Deshmukh |
|
nice Comment from : Vishrut Deshmukh |
|
Really professional explanation Comment from : The cat |
|
awesome Comment from : 張建發 |
|
confusing Comment from : Everything With Anirudha |
|
Very veryyyyy good explanation thank you sir Comment from : Rachna Sharma |
|
Thank you so much, never felt this good while taking a lecture ❤ Comment from : scry crystals |
|
Awesome guru ji Comment from : Rawnak freak |
|
Y 0 Comment from : Rawnak freak |
|
27:02 (2,3) we can see exists in both set 2 and set 1 (containing (2,3),(3,5)) How come we’re including item in the bag? In the video it says (2,3) does not exist in set1 Comment from : H Brian |
|
Really helpful Thank you Sir! Comment from : Ansil Thomas |
|
thnq so much sir Comment from : srikanth talks |
|
hi ashley Comment from : Troy |
|
nice videooo sirji Comment from : Madhav Jindal |
|
6:00 Comment from : Turtle |
|
Man is a legend Comment from : Syntax |
|
Not from computer science background This video is everything I neededbrThank you from the bottom of my heart❤ Comment from : Subhasmita Jena |
|
Sir can you just tell me the what is Rod Cutting algorithm i love the way you teach if you can help me please Comment from : Preet Sangeet |
|
Great job Comment from : RathanCode |
|
thank you very much professor br! Comment from : Ismail Ozcan |
|
Thanks a Lot Comment from : kiranmai k |
|
very nie ,good explanation -----perfectly explained👍 Comment from : Hementh Chintapalli |
|
Nice explanation Comment from : Karan Bhanushali |
|
what are the different methods of dynamic programming? Comment from : Iana Faye |
|
Thank u sir 🙏 Comment from : Manikanta ー匚卄 |
|
After watching, my understanding is much better, but I still have 3 questionsbr1 we must sort the items by weight first?br2 in the example, the profit is higher as the weight get higher, that means, you will always choose the heavier weight as you have a bigger sack, what if the profit is smaller than the one's with lighter weight, for example, item 1 has a weight of 1 and profit of 2, item 2 has a weight of 2 and profit of 1, now the iterator goes to item 2, the sack capacity is 2, is the profit 1(item 2's value) or 2(item 1's value) to be filled to the table v{2, 2}? if I understand correctly, if the iterator goes to item 2, we will choose item 2, so the profit is 1 instead of 2, in this case, how do we know what the max capacity is when the sack's capacity is 2?(It should be 2)br3 how you result in getting the formula, what is the reasoning process? Comment from : Wenjie Liu |
|
جزاك الله خير الله يبارك فيك و بعلمك Comment from : colorless |
|
ThankYou❤️❤️ Comment from : Harman Narula 7603 |
|
What a wonderful explanation!!! I really thank you! Comment from : Mike Delta |
|
00:00 DP methodbr19:19 set method Comment from : Viên Công |
|
Very good strctured explaination Comment from : Oebele Hopsakee |
|
I love you Abdul Bari Comment from : Elisabeth Shevtsova |
|
Sir your explanation is incredibly helpful! Thank you Comment from : George Paul |
|
YOU ARE A LEGEND SIR 🙏 Comment from : Aman Gupta |
|
yes this man really deserv everything Comment from : parth anuj |
|
if in question it is not given fractional or 0/1 and its also not given use greedy or dynamic so what approach should i use to solve problems Comment from : 360 |
|
If god exists, its this man Comment from : Lakshya Yadav |
|
great Comment from : Vedant |
|
Top Notch Explanation ! Comment from : Manish Vankudre |
|
Thank you sir Comment from : Vaishnavi Patil |
|
The best and easiest way to learn! Thankyou Sir! Comment from : Richa Ambapkar |
|
Ohhh thank you sooo much sir I'm very happy to understand the knapsack Comment from : Hafiza Saira Kanwal |
|
Doesn't work if weights are same of two items Comment from : S M Muhtasimul Hasan 2031808642 |
|
CRYSTAL CLEAR EXPLAINATION LAST METHOD IS EASY from @19:32THANK ME LATER Comment from : sahil_musicsss |
|
bitches be callin’ me knapsack cuz they know I be gettin’ that max bag💰 Comment from : Harsh Ahuja |
|
explication is very easy to understand with both method Comment from : Kiran kadam |
|
Thanks Comment from : magdi amer |
|
Dear Sir, Only the Genius mind can give these kind of explanation and make it looks simple You are genius sir Thanks a lot for sharing tremendous knowledge to usbrAccording to me, for this moment I can see the God in you that shows a way for my well being You are the GOD ❤ Comment from : Harish_Madhan_Edits |
|
Thank you very much for your teachings! I appreciate it! Comment from : Diptanshu Giri |
|
NYC sir Comment from : Laadi army HR |
|
Areee nuv eam chepthunnavoo niku inaa ardham avthundhaa monna ni example rasa exam 0 0 vesaruuuu Comment from : AVULURI PAVAN |
|
Thanks a lot Comment from : Md Alamin Talukder |
|
Ehrenmann Comment from : Holzrusse |
|
Huge thanks to you sir🙏🙏 Comment from : rishab s |
|
sir pls give the notes, i am not able to note everything you told and revision before exam is must Thx for teaching us these topics with so much ease aswell Comment from : error69 |
|
👏👏 thanks you sir 🤍 Comment from : sravan gaddameedi |
![]() |
Knapsack Problem using Dynamic Programming Part I | Dynamic Programming | Lec 65 | DAA РѕС‚ : CSE Guru Download Full Episodes | The Most Watched videos of all time |
![]() |
dynamic amoled 2x | dynamic amoled 2x vs dynamic amoled | dynamic amoled 2x 120hz hdr10+ РѕС‚ : Tech Duggar Download Full Episodes | The Most Watched videos of all time |
![]() |
0/1 Knapsack problem | Dynamic Programming РѕС‚ : WilliamFiset Download Full Episodes | The Most Watched videos of all time |
![]() |
0-1 Knapsack Problem (Dynamic Programming) РѕС‚ : CS Dojo Download Full Episodes | The Most Watched videos of all time |
![]() |
0/1 Knapsack Problem Dynamic Programming РѕС‚ : Tushar Roy - Coding Made Simple Download Full Episodes | The Most Watched videos of all time |
![]() |
0-1 Knapsack Problem - Dynamic Programming РѕС‚ : CSBreakdown Download Full Episodes | The Most Watched videos of all time |
![]() |
0/1 Knapsack Problem Using Dynamic Programming - Tutorial u0026 Source Code РѕС‚ : Stable Sort Download Full Episodes | The Most Watched videos of all time |
![]() |
01 Knapsack Tabulation Dynamic Programming | How to build DP table РѕС‚ : Techdose Download Full Episodes | The Most Watched videos of all time |
![]() |
0/1 knapsack problem | example| dynamic programming РѕС‚ : Education 4u Download Full Episodes | The Most Watched videos of all time |
![]() |
Dynamic Programming | Set 10 (0-1 Knapsack Problem) | GeeksforGeeks РѕС‚ : GeeksforGeeks Download Full Episodes | The Most Watched videos of all time |