i have not enough words to thank you.I had spine injury 2 years ago.So i am in wheelchair .With your help i have completed my degree. Really thank you sir. God bless you sir
hey, No teacher is better or worse. A teacher is a teacher and we have to respect every teacher around us. If you feel your teacher is not suitable for your mindset then change your path. No offense. Thanks.
@@muhammadusama5329 Very well said! All teachers deserve respect for what they do. There will always be some exceptions but even they should be respected for their passion and dedication towards this noble profession.
@@muhammadusama5329 You clearly haven't had a class with a professor who teaches so poorly that more than half the students fail or drop out. There is such a thing as bad teaching.
@@muhammadusama5329Counterexample: My professor falsely accuses students, ruins their lives with the accusation, blocks students from receiving tutoring or seeking help, has driven other professors away, and gloats about his high (nearly 70%) fail-rate. His algorithms assignments have nothing to do with what he teaches. There are no other options at this school and you can't transfer the class in. My teacher is absolutely the worst, ever.
While others were struggling I just rocked in VIVA ! Showed full iteration. Thanks a ton Sir. Looking forward more from your Pandora's box. Take my humble regards 🙏
Watching your videos is when it really clicked for me that I need to drop the just-show-me-the-code-already mentality. Interviewers are more interested in this level of understanding than regurgitating flawless code on a whiteboard. If you take the time to watch videos like this you can write the code yourself because you really understand the underlying algorithm.
Hey can you tell me that while we eliminate an ordered pair using dominance rule...so for applying that rule our ordered pairs should be arranfed in ascending order of profits right??
Sir you saved my life, I’m from university of Toronto, computer science specialist, I have adhd and always fell asleep in class, I found it’s hard to follow with my professor, but your videos made the topic understandable and interesting !!
@@ConverttoHinduism indians love to go to canada lol, UofT is far superior than anything in India we see indians go to canada for education but never a canadian who went to india 😂
sir ,whenever i watch you explaining a topic one word pops up in my head "Learning sometimes seems Beautiful! and this is the way we should learn something".
Just for future readers: the order of the items does not matter; no need to sort them. ``` import random m = 8 p = 1, 2, 5, 6 w = 2, 3, 4, 5 items = list(zip(p, w)) random.shuffle(items) results = [0] * (m + 1) for item_profit, item_weight in items: for target_weight in range(m, item_weight - 1, -1): results[target_weight] = max(results[target_weight], results[target_weight - item_weight] + item_profit) print(results) ```
Words are not enough to Thank you Sir! After going through a lot of videos, finally i found something which has cleared all my doubts regarding this problem. Thankyou 🙏🙏
Sir, I have never studied before the set method of 0/1 knapsack, after watching this video, i got to know about the set method which is very easy method, Thank you so much Sir
Well I have my algorithm exam tomorrow and honestly I don't like to read algo .. i was depressed that I might fail on my exam but then I found your channel and started learning ... And i'm quiet sure that I'm not gonna fail atleast ... Your videos really helped me a lot .. thank you so much sir ... Thanks a lot
The second method was much easier... N i watched your other videos as well ... Really useful for my DAA exam preparation... properly explained all steps
110% marks to you sir.. This is a very complicated problem to understand. But after going through this video and actually drawing it in notebook i found it actually very easy..
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.
I tried several tutorial, but this is the best and easiest to understand. I especially was looking for how the formula is used to derived the values in the table and this tutorial explains it as well. Thanks a lot
Well explained and easy to understand - though there's a mistake I think at around 18:20 where you say to subtract the profit of the item to get what to search for in the previous row, but you should be subtracting the weight of the chosen item from the weight of the bag (8-5 = 3) to get the column of the previous row(s) to check for inclusion. This more intuitively makes sense to me as well, because you're ultimately just splitting the problem into smaller sub-problems - you've chosen the 4th item to include in the bag, and now you're looking at the previous row to determine what was the optimal solution for a bag of size 3, now that the _remaining_ weight you have to work with is 3. The additional profit you can add to a bag of size 3 is 2, so the rest of the explanation is the same. With that correction, I think the explanation is good enough as well that it's really easy to expand from a 0/1 solution to a 0/n solution (including as many of each item as you want).
i think 8-6 =2 used because max profit for bag is 8 and 8 is located in 5th row which is wight 5 which selected for including in bag. and then maximum profit is 8 5th row profit is 6 then 8-6 = 2 , and now we have to search in which row profit 2 is located which is 3rd row of weight 3 so in bag{wi 3,5} selected with max profit 8. please correct me if i am wrong
@@fardinalam7290 - I think that's incorrect, you want to subtract weight because that's the bounded variable. You want the most profit per unit of weight, and there's no limit to potential profit. Conceptually, you're solving sub-problems until you reach the final query. If ƒ(8) says the optimal item to take is weight 5, then you add its value, and query with the remaining bag capacity for ƒ(3), repeat until done. You don't want to take off the price, because that's a different unit than your input variable of weight. Note: I haven't watched this in a while, so I'd have to review it to be sure. I recommend solving the problem on paper, it helps give a better understanding of how it works. Especially if you explain it to someone else. However, that gave me an idea - it could be interesting to add another bound for this to limit the price as well - rather than taking items worth as much as possible like some kind of heist, maybe you're instead buying so you want to keep the price low, haha.
Truly sir, watch many 0/1 knapsack video, got too puzzeled, how to solve this tabulation, readings article for the same, but gets on the sport clearation here, thank u so much sir for sharing ur vast knowledge with the students like us
Seriously sir just because of you i feel relax ....i was just in depression of this type of examples cause i thought it takes lot of time ...but you proved me wrong .. thanking you sir
teaching is an art .... after wasting 24 hours to understate a lecture of same topic by some crazy optimization expert from very reputed university of west.... i finally, or would say i "Luckily" found this video, thank you for making it so simple ...
Never heard of your channel before, unfortunately. Just watched this video, and I don't need a second one to understand the problem. I guess that's as good a compliment as it gets
Sir I have seen videos on how to fill the table in knapsack problem. But u have explained why we are filling a particular value in that way only. You are an amazing teacher . Thankyou so much Sir.
गुरू ब्रह्मा गुरू विष्णु, गुरु देवो महेश्वरा गुरु साक्षात परब्रह्म, तस्मै श्री गुरुवे नमः 🙏🚩🚩🙏 इम्तिहान में सर्वदा अवल व बेहतर अंक आए 🙏🙏🚩🚩🛕🛕💐💐🪔🪔🌞🌞😊😊🕉️🕉️🕉️🛕🛕🚩🚩🙏🙏🌹🌹🌷🌷⛳⛳😃😃🇮🇳🇮🇳👏👏🦚🦚
Best approach to solve any dp: 1. Learn to develop recursive logic from scratch. (TC is worst, you might end up with TLE) 2. Memoize the same recursive logic. (optimize TC but end up using extra space. SC is probably worse now) 3. Learn the art of transforming recursive logic to tabular. (you end up saving call stacks) 4. Optimize the space complexity as well. (now you have optimized space as well) PS: thank you sir, if you weren't there, probably many wouldn't have tried in the first place.
Even if I'm not using all of it now I bought both courses on udemy, because you algorith classes are helping me SO much with my Undergraduate thesis thank you
Breakdown of the formula: ⭐V: DP table which stores values of subproblems ⭐V[i, w]: Maximum profit by considering the first 'i' elements in a bag of weight 'w' ⭐V[i-1, w]: Case when the current object is not included(~0) and the bag with current weight 'w' must be filled with the maximum profit possible (stored at 'i-1') ⭐V[i-1, w-w[i]] + p[i]: Case when the current object is included(~1) and the remaining part of the bag 'w-w[i]' must be filled with the maximum profit possible (stored at 'i-1') (~ Hence the name 0/1 knapsack problem)
Thank you sir, as you know its soo hard to remember the rules of AI maths for a long time. Exam is knocking on the door and you just saved a lot of us. Thanks a lot sir, you r great
Really Helpful videos... My go-to videos for my entire Data Structures and Algorithms course in college. Even now it is helping me prepare for competitive coding.
In w - w[i] expression, the first w refers to the capacity and the second w refers to the weights list. It would be better to rename one of them. for example declaring the capacity as c. totally the way of teaching is delicious and the teacher has so much of charisma. Thanks to him!
wow...... This was probably the best explaination video on 0-1 knapsack problem on you tube (even better than the one uploaded by geeks for geeks ). Thank you so much for this .
Thank you so much for your explanation sir, it was very clear and left no room for ambiguity. Really appreciate the efforts you make for us! Thanks again!
There teachers are freely available on RUclips, whereas after paying lacs of rupees, we don't get such tutors in our colleges. This is true Digital India.
Incredible sir :) In my college these kind of topics remained at the end and never taught...and taught hurrily as instructor wanted to run away from the situation...and this happens to big colleges also sometimes... thanks a lot for teaching me... real Guru :)
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 us. According to me, for this moment. I can see the God in you that shows a way for my well being. You are the GOD ❤
This might help somebody: In the last row of tabulation method, the formula basically says we are checking the max of: 1) the best profit we have till now for a bag with weight w, versus 2) if we put current item, the profit we could have + the max profit in remaining bag capacity we calculated. So, for e.g. consider 7kg bag. 5kg we put for last row item. Remaining 2. What's the best profit we can have with that 2kg.
Sir why did you stop uploading videos you are great please continue it 🙏 dsa , java, courses etc. all my concepts are clear by your videos. I humbly request u to start uploading again.
i have not enough words to thank you.I had spine injury 2 years ago.So i am in wheelchair .With your help i have completed my degree. Really thank you sir. God bless you sir
lmao
@@yashdeepsingh1519 dude wtf 😂, why would u "lmao" this comment
i hope you're better now.
Meaning of imao?@@cityisbetter
@@fayezchamp9365 its L M A O not i, Laughing My Ass Off
this man deserves a nobel or something.
You are Ω(2^n) times better than my teacher!
hey, No teacher is better or worse. A teacher is a teacher and we have to respect every teacher around us. If you feel your teacher is not suitable for your mindset then change your path. No offense.
Thanks.
@@muhammadusama5329 oh yeah your vision matters
@@muhammadusama5329 Very well said! All teachers deserve respect for what they do. There will always be some exceptions but even they should be respected for their passion and dedication towards this noble profession.
@@muhammadusama5329 You clearly haven't had a class with a professor who teaches so poorly that more than half the students fail or drop out. There is such a thing as bad teaching.
@@muhammadusama5329Counterexample: My professor falsely accuses students, ruins their lives with the accusation, blocks students from receiving tutoring or seeking help, has driven other professors away, and gloats about his high (nearly 70%) fail-rate. His algorithms assignments have nothing to do with what he teaches. There are no other options at this school and you can't transfer the class in. My teacher is absolutely the worst, ever.
Besides actually learning what I need to know, the best part about these videos is how nice and respectful everyone is
Pasd hua kya😂
A simple white board and you blow most teachers out of the water. You are a VERY gifted teacher and I thank you!
While others were struggling I just rocked in VIVA ! Showed full iteration. Thanks a ton Sir. Looking forward more from your Pandora's box. Take my humble regards 🙏
Bro what do u study???
@@arkasingha6111 DAA or Design and Analysis of Organisation
Hjjjkjlĺo9
@@fathimashahana9594 wt f babe
@@pkyadav6230 nice go say it to your mom also
Watching your videos is when it really clicked for me that I need to drop the just-show-me-the-code-already mentality. Interviewers are more interested in this level of understanding than regurgitating flawless code on a whiteboard. If you take the time to watch videos like this you can write the code yourself because you really understand the underlying algorithm.
your way of explaining is best among all videos.
Vivek Pandey achcha Bhai pandey😂😂 bilkul shi kaha
Exam kesa gya bro , mera to first class gya...
agree
nah fam, check me out :) I cover this topic
@@BackToBackSWE you explained string edition so well
Amazing thing is , you don't need any institute but student's like us need you most sir 🙏🏻
For your teaching experience and explanation take a bow👏🙌💯
SET method for solving 0/1 Knapsack starts at 19:26. And for Tabular method watch the lecture from the beginning. Thanks
🤣 thanks
Hey can you tell me that while we eliminate an ordered pair using dominance rule...so for applying that rule our ordered pairs should be arranfed in ascending order of profits right??
yes profits should be in ascending order @@aarushitiwari4787
@@aarushitiwari4787 arranging the weights in ascending is the key here...because then we always check which prev weight to include or not
Sir you saved my life, I’m from university of Toronto, computer science specialist, I have adhd and always fell asleep in class, I found it’s hard to follow with my professor, but your videos made the topic understandable and interesting !!
lmao , university of toronto is awesome , good luck with classes
So you have Schizophrenia as well?
University doesn't matter, knowledge matter. People who don't get seats here in India go to Toronto University
@@ConverttoHinduism indians love to go to canada lol, UofT is far superior than anything in India
we see indians go to canada for education but never a canadian who went to india 😂
@@ConverttoHinduism do you even know how good university of toronto is. you don't. hence, don't speak.
I tried to learn it from people but salute to this guy. He's Amazing!!! Thank you so much.
sir ,whenever i watch you explaining a topic one word pops up in my head "Learning sometimes seems Beautiful! and this is the way we should learn something".
13 words hai bhaisaab
This dude is a legend or what ??? ! His calmness , calms my soul! .,.. *Cries* !! Keep it up Bari Bhai
This is the clearest explanation of the knapsack problem I've ever found online, thank you sir!
You are born to teach complex concepts in a simple way. Bunch of thanks sir❤❤💫
Remember to always write the weight in ascending order on the left of the table.
bro did you watch the video.
@@jay-rathod-01 He is not wrong
i dont think it is necessary as by the end all of the objects are considered and you would have filled the cells with maximum profit
Just for future readers: the order of the items does not matter; no need to sort them.
```
import random
m = 8
p = 1, 2, 5, 6
w = 2, 3, 4, 5
items = list(zip(p, w))
random.shuffle(items)
results = [0] * (m + 1)
for item_profit, item_weight in items:
for target_weight in range(m, item_weight - 1, -1):
results[target_weight] = max(results[target_weight],
results[target_weight - item_weight] + item_profit)
print(results)
```
@@theundescribable1643aq1
Words are not enough to Thank you Sir!
After going through a lot of videos, finally i found something which has cleared all my doubts regarding this problem. Thankyou 🙏🙏
Love your videos! Just purchased your data structures course on Udemy because you explain things so well.
I wish we had such great material during our college days. Huge thanks to you!! Keep rocking.
Get this man a shield of subscribers! U are saving ur time ...for understanding these problems. Keep working and THANKS IS ADVANCE FOR FUTURE VIDEOS.
Amazing sir. I simply love it when you release an "Acha" During your lecture
haha.. can't hold his Indian back for long
Sir, I have never studied before the set method of 0/1 knapsack, after watching this video, i got to know about the set method which is very easy method, Thank you so much Sir
Well I have my algorithm exam tomorrow and honestly I don't like to read algo .. i was depressed that I might fail on my exam but then I found your channel and started learning ... And i'm quiet sure that I'm not gonna fail atleast ... Your videos really helped me a lot .. thank you so much sir ... Thanks a lot
You are probably one of the best instructors I've ever come across
It was easy to understand. I'm grateful to teachers like you for your great way of explaining concepts of C.S.E.
Not from computer science background. This video is everything I needed.
Thank you from the bottom of my heart.❤
Best channel on RUclips for DAA
Stop wasting time on finding others channel just follow this channel
and this udemy course is also super nice
Thank you so much sir!!! I passed my DAA exam only with the help of your videos!! Sincere thanks!
Saving my life just in time for finals! Thank You!
wait u dont think he is ugly tho that was slightly off-putting lol 😅
Sir your method of teaching is absolutely phenomenal. would have never understood complex topics in DAA without your videos
The second method was much easier... N i watched your other videos as well ... Really useful for my DAA exam preparation... properly explained all steps
but its 2^n bro
Its looking very easy to me now, today in class I wasn't able to understand it so I looked up for the problem on youtube and I met a genius. Thank you
110% marks to you sir.. This is a very complicated problem to understand. But after going through this video and actually drawing it in notebook i found it actually very easy..
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.
Your method is the easiest, which explains the two method. It makes the algorithm easy to understand. Thanks a lot sir.
I tried several tutorial, but this is the best and easiest to understand. I especially was looking for how the formula is used to derived the values in the table and this tutorial explains it as well. Thanks a lot
Well explained and easy to understand - though there's a mistake I think at around 18:20 where you say to subtract the profit of the item to get what to search for in the previous row, but you should be subtracting the weight of the chosen item from the weight of the bag (8-5 = 3) to get the column of the previous row(s) to check for inclusion. This more intuitively makes sense to me as well, because you're ultimately just splitting the problem into smaller sub-problems - you've chosen the 4th item to include in the bag, and now you're looking at the previous row to determine what was the optimal solution for a bag of size 3, now that the _remaining_ weight you have to work with is 3. The additional profit you can add to a bag of size 3 is 2, so the rest of the explanation is the same.
With that correction, I think the explanation is good enough as well that it's really easy to expand from a 0/1 solution to a 0/n solution (including as many of each item as you want).
i think 8-6 =2 used because max profit for bag is 8 and 8 is located in 5th row which is wight 5 which selected for including in bag. and then maximum profit is 8 5th row profit is 6 then 8-6 = 2 , and now we have to search in which row profit 2 is located which is 3rd row of weight 3 so in bag{wi 3,5} selected with max profit 8. please correct me if i am wrong
@@fardinalam7290 - I think that's incorrect, you want to subtract weight because that's the bounded variable. You want the most profit per unit of weight, and there's no limit to potential profit.
Conceptually, you're solving sub-problems until you reach the final query. If ƒ(8) says the optimal item to take is weight 5, then you add its value, and query with the remaining bag capacity for ƒ(3), repeat until done. You don't want to take off the price, because that's a different unit than your input variable of weight.
Note: I haven't watched this in a while, so I'd have to review it to be sure. I recommend solving the problem on paper, it helps give a better understanding of how it works. Especially if you explain it to someone else.
However, that gave me an idea - it could be interesting to add another bound for this to limit the price as well - rather than taking items worth as much as possible like some kind of heist, maybe you're instead buying so you want to keep the price low, haha.
Why to worry when you have Abdul Bari
Dei avanthada periya velaya pathutu poitan 😂😂
@@dossexploresyean enna achu
@@dossexploresExam thapa agidutcha bro
No need to magaj Mari when you have Abdul Bari
@@vishalrajalunaku edhathu thapa aghidutcha bro
You're the best! You teach in such a way that we understand the concept entirely!
Truly sir, watch many 0/1 knapsack video, got too puzzeled, how to solve this tabulation, readings article for the same, but gets on the sport clearation here, thank u so much sir for sharing ur vast knowledge with the students like us
Seriously sir just because of you i feel relax ....i was just in depression of this type of examples cause i thought it takes lot of time ...but you proved me wrong .. thanking you sir
teaching is an art ....
after wasting 24 hours to understate a lecture of same topic by some crazy optimization expert from very reputed university of west.... i finally, or would say i "Luckily" found this video,
thank you for making it so simple ...
the best professor I ever had, professor Abdul Bari is amazing!
Yup
Never heard of your channel before, unfortunately. Just watched this video, and I don't need a second one to understand the problem. I guess that's as good a compliment as it gets
You are not teacher you are god of computer science...hats off u sir
Sir I have seen videos on how to fill the table in knapsack problem. But u have explained why we are filling a particular value in that way only. You are an amazing teacher . Thankyou so much Sir.
Please reply what if m =30
How many columns should we take ??
Sir, you cleared all confusions. Thanks a ton, You made it very easy to understand.
after 6 yrs also , the video is looking like a gold.
गुरू ब्रह्मा गुरू विष्णु, गुरु देवो महेश्वरा गुरु साक्षात परब्रह्म, तस्मै श्री गुरुवे नमः
🙏🚩🚩🙏
इम्तिहान में सर्वदा अवल व बेहतर अंक आए 🙏🙏🚩🚩🛕🛕💐💐🪔🪔🌞🌞😊😊🕉️🕉️🕉️🛕🛕🚩🚩🙏🙏🌹🌹🌷🌷⛳⛳😃😃🇮🇳🇮🇳👏👏🦚🦚
Great Gurudev Ji 🙏🙏🌹🌹🙏🙏⚽⚽🤗🤗💖💖💯💯🇮🇳🇮🇳⛳⛳🌹🌹🚩🚩🕉️🕉️🛕🛕🌞🌞🌸🌸📚📚🌺🌺🎈🎈🎯🎯💓💓✅✅💯💯🇮🇳🇮🇳🙏🙏
you are heaven sent - i got it after watching the first 10 minutes, i love your videos, the are super helpful
Best approach to solve any dp:
1. Learn to develop recursive logic from scratch. (TC is worst, you might end up with TLE)
2. Memoize the same recursive logic. (optimize TC but end up using extra space. SC is probably worse now)
3. Learn the art of transforming recursive logic to tabular. (you end up saving call stacks)
4. Optimize the space complexity as well. (now you have optimized space as well)
PS: thank you sir, if you weren't there, probably many wouldn't have tried in the first place.
Love the explanation! Can you elaborate what is meant by TC, TLE and SC?
@@alexwhitewood6480 TC : Time complexity
TLE: Time limit Exceeded
SC: Space complexity
Even if I'm not using all of it now
I bought both courses on udemy, because you algorith classes are helping me SO much with my Undergraduate thesis
thank you
Seriously I owe you a lot as your way of explaining the concept is very helpful to below average students like me. Thank you so much Sir.
Breakdown of the formula:
⭐V: DP table which stores values of subproblems
⭐V[i, w]: Maximum profit by considering the first 'i' elements in a bag of weight 'w'
⭐V[i-1, w]: Case when the current object is not included(~0) and the bag with current weight 'w' must be filled with the maximum profit possible (stored at 'i-1')
⭐V[i-1, w-w[i]] + p[i]: Case when the current object is included(~1) and the remaining part of the bag 'w-w[i]' must be filled with the maximum profit possible (stored at 'i-1')
(~ Hence the name 0/1 knapsack problem)
My brain got damaged
Thnx
why 0/1 knapsack needs a 2d array to memoize whereas house robber needs 1d array ? both are similar problems
@@jaideepsingh7955 In house robber we calculate Profit/weight where as in 0/1 Knapsack we can't divide the objects thus we store the profit value..
Brain left
Thank you sir, as you know its soo hard to remember the rules of AI maths for a long time.
Exam is knocking on the door and you just saved a lot of us. Thanks a lot sir, you r great
Big salute to sir for explaining it so well! Best explanation of tabulation method of knapsack till now on RUclips!
without you sir what would we do. You are the savior of computer engineering students
Thank you sir, this is the clearest explanation in this topic, the others just blindly apply formula without explanation.
thanks a Ton for the set method.Great explanation sir.Your video order almost matches with my syllabus.You are my DAA exam saviour
Hahahaha
Even mine😘😘
my too
me too....in my case it's ADA subject
Peddinti Kartik cmt
Ĺugj
Even mine too
Really Helpful videos... My go-to videos for my entire Data Structures and Algorithms course in college. Even now it is helping me prepare for competitive coding.
In w - w[i] expression, the first w refers to the capacity and the second w refers to the weights list. It would be better to rename one of them. for example declaring the capacity as c.
totally the way of teaching is delicious and the teacher has so much of charisma.
Thanks to him!
wow......
This was probably the best explaination video on 0-1 knapsack problem on you tube (even better than the one uploaded by geeks for geeks ). Thank you so much for this .
king of the algorithms ...thanks from Turkey..
For the first time I'm forced to comment on these educational videos cause, I mean you the BEST LECTURER,,, You deserve a nobel or smth really...
Thank you Mr. Abdul Bari. I am grateful for your lectures.
You explain it in such a clear and simple way, finally i understand it, thank you very much!
Assalamualikum Sir ! Your videos are precise and to the point ! Provides decent understanding of the topic ! No words to thank you .
Thank you so much for your explanation sir, it was very clear and left no room for ambiguity. Really appreciate the efforts you make for us! Thanks again!
Wow, thank you so much, I've been struggling with this and you explained it so nicely!! Excellent job!!
Best youtube-tutor ever...Thank You very much Sir!! Learnt a lot .
You make the subject easiest.
We are thankful to you sir.
There teachers are freely available on RUclips, whereas after paying lacs of rupees, we don't get such tutors in our colleges. This is true Digital India.
THE BEST TEACHER EVER !!! VERY WELL EXPLAINED #THANK_YOU_SIR !
You are saving lives of so much engineers sir , keep doing..
i pray Allah award you jannah for this explanation. Thank you so much.
AMEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEN
Right bro
you have a very soothing voice.
I was stressing about this, but now it both makes sense and I have been calmed
I will be graduated by watching these videos only rather than listening my faculty lectures ❤
Same bro
I thank you so much for this. I could never understand the lecture of my university, but you sir saved me. I cannot thank you enough.
Thank you, Sir, so much. Today, I performed very well in my Algorithms exam only because of you. You are the best instructor ever 👍.
++
- -
* *
sir, I have gone through various videos on this topic but your way of explanation is the best among others. thank you very much
Incredible sir :) In my college these kind of topics remained at the end and never taught...and taught hurrily as instructor wanted to run away from the situation...and this happens to big colleges also sometimes... thanks a lot for teaching me... real Guru :)
This is the most clear lecture for the Knapsack problem.
So much efforts have been put in. Thank you so much for such great explanation and content! Pace of explanation is excellent!
Thank you! Today we have a Final exam and your lecture is very well explained!
Thank you for this amazing lecture sir.. Wonderful explanation. Clear.
thank you so much!!! i'll make sure I mention your name during my degree acceptance speech
I highly recommend his udemy courses. He is possibly the best Algorithm teacher on the internet. All the complicated things were explained with ease.
is there any difference in the videos available on youtube and the videos on udemy course?
It means you guys don't know about Ravindra babu Sir
@@ravigupta4252 chutiya he voo
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 us.
According to me, for this moment. I can see the God in you that shows a way for my well being. You are the GOD ❤
I've watched 95% of the alghoritms playlist. I sure own this teacher some money, is to much work done. How do we support him?
He has a patreon link in the description of this video
simply amazing , explained topics clearly
Tomorrow exam 😅
Same 😂
It was easy to understand. Thank you, professor.😎
Sir u are an awesome teacher !! RESPECT !!
Your method is too good, i like the way you teach.
you explain all the things in very less time, I like this type of teaching
It is best explanation video of knapsack.
Thank you sir!!
you are really an best teacher in the world of computer science
This might help somebody:
In the last row of tabulation method, the formula basically says we are checking the max of:
1) the best profit we have till now for a bag with weight w,
versus
2) if we put current item, the profit we could have + the max profit in remaining bag capacity we calculated. So, for e.g. consider 7kg bag. 5kg we put for last row item. Remaining 2. What's the best profit we can have with that 2kg.
Hey, we do that formula just at last row right..??
@@samhita2917 Yes.
You are correct sir. The sum of all weights is 14. Splendid!
Sir why did you stop uploading videos you are great please continue it 🙏 dsa , java, courses etc. all my concepts are clear by your videos. I humbly request u to start uploading again.
His course available on Udemy
That was really good. Much better than most of the other explanations out there. Just need to find a way to code it now.