this man deserves a nobel or something. You are Ω(2^n) times better than my teacher!

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

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 🙏

Why to worry when you have Abdul Bari

Besides actually learning what I need to know, the best part about these videos is how nice and respectful everyone is

your way of explaining is best among all videos.

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.

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👏🙌💯

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

A simple white board and you blow most teachers out of the water. You are a VERY gifted teacher and I thank you!

It was easy to understand. I'm grateful to teachers like you for your great way of explaining concepts of C.S.E.

I wish we had such great material during our college days. Huge thanks to you!! Keep rocking.

Remember to always write the weight in ascending order on the left of the table.

You are born to teach complex concepts in a simple way. Bunch of thanks sir❤❤💫

Wow, thank you so much, I've been struggling with this and you explained it so nicely!! Excellent job!!

Love your videos! Just purchased your data structures course on Udemy because you explain things so well.

This is the clearest explanation of the knapsack problem I've ever found online, thank you sir!

You are probably one of the best instructors I've ever come across

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.

You're the best! You teach in such a way that we understand the concept entirely!

I tried to learn it from people but salute to this guy. He's Amazing!!! Thank you so much.

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

best video in knapsack ever! and I have watched a bunch to understand how it works! Thank you so much!!!

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

Saving my life just in time for finals! Thank You!

So much efforts have been put in. Thank you so much for such great explanation and content! Pace of explanation is excellent!

Not from computer science background. This video is everything I needed. Thank you from the bottom of my heart.❤

Big salute to sir for explaining it so well! Best explanation of tabulation method of knapsack till now on KZfaq!

Assalamualikum Sir ! Your videos are precise and to the point ! Provides decent understanding of the topic ! No words to thank you .

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

you have a very soothing voice. I was stressing about this, but now it both makes sense and I have been calmed

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

Your method is the easiest, which explains the two method. It makes the algorithm easy to understand. Thanks a lot sir.

Sir, you cleared all confusions. Thanks a ton, You made it very easy to understand.

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.

Thank you so much sir I wasn't getting the set method but because of you I am now able to solve problem using it You are a great teacher sir .You are doing a great job. It will help me in passing the exam

SET method for solving 0/1 Knapsack starts at 19:26. And for Tabular method watch the lecture from the beginning. Thanks

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.

Thank you so much sir!!! I passed my DAA exam only with the help of your videos!! Sincere thanks!

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

Thank you for this amazing lecture sir.. Wonderful explanation. Clear.

It is best explanation video of knapsack. Thank you sir!!

All your videos are extremely helpful and easy to understand! Thanks!

Thank you so much sir. This is wonderful session. I nevered attend like this session in my college life. It was amazing. I understood totally about 0 and 1 knapsack. 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".

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!

Thank you for explaining in so much easy way. Your all videos match with my syllabus. You are doing very well. Keep it up

Amazing sir. I simply love it when you release an "Acha" During your lecture

thanks a Ton for the set method.Great explanation sir.Your video order almost matches with my syllabus.You are my DAA exam saviour

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

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

Sir u are an awesome teacher !! RESPECT !!

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

Perfect lesson! So well paced and comprehensive.

You make the subject easiest. We are thankful to you sir.

You are not teacher you are god of computer science...hats off u sir

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.

That was really good. Much better than most of the other explanations out there. Just need to find a way to code it now.

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

without you sir what would we do. You are the savior of computer engineering students

sir, I have gone through various videos on this topic but your way of explanation is the best among others. thank you very much

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 .

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 BEST TEACHER EVER !!! VERY WELL EXPLAINED #THANK_YOU_SIR !

Thanks for taking the pain to explain in detail the equation for the last row in Dynamic Programming! All made clear which did not at all in the class.

Thank you so much, never felt this good while taking a lecture ❤

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

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

You are simply awesome Sir ! Exceptional clarity in explanation.

Beautiful! May God bless you and your family and give you jannah Insha'Allah. I can't express my gratitude. Thaaaaank you sooooooooo much!

Best channel on KZfaq for DAA Stop wasting time on finding others channel just follow this channel

the best professor I ever had, professor Abdul Bari is amazing!

This dude is a legend or what ??? ! His calmness , calms my soul! .,.. *Cries* !! Keep it up Bari Bhai

You are saving lives of so much engineers sir , keep doing..

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.

गुरू ब्रह्मा गुरू विष्णु, गुरु देवो महेश्वरा गुरु साक्षात परब्रह्म, तस्मै श्री गुरुवे नमः 🙏🚩🚩🙏 इम्तिहान में सर्वदा अवल व बेहतर अंक आए 🙏🙏🚩🚩🛕🛕💐💐🪔🪔🌞🌞😊😊🕉️🕉️🕉️🛕🛕🚩🚩🙏🙏🌹🌹🌷🌷⛳⛳😃😃🇮🇳🇮🇳👏👏🦚🦚

Thank you sir, this is the clearest explanation in this topic, the others just blindly apply formula without explanation.

You are the best one Sir ... And the way you explain is so fabulous sir... Thank you for your such great explanation of the topics ....

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!

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)

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.

Man where were you when I needed you back in college!!!!

I will be graduated by watching these videos only rather than listening my faculty lectures ❤

thank you so much sir. this lecture really helped me a lot

hi sir you explained it the best among the videos that i have listened to, thank you so much, keep up the good work :)

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

Thank you sir I understand lot for seeing u r videos.. I didn't understand in cls u explain very well .. plzz do some more videos it will helpfull for us..

king of the algorithms ...thanks from Turkey..

You are a great teacher sir. Your video was the best . Thank you sir !!!

There teachers are freely available on KZfaq, 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 :)

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?

Thank you! Today we have a Final exam and your lecture is very well explained!

Best video on youtube for 0/1 Knapsack. Hatsoff sir

Thank you so much sir best available lectures on KZfaq soon you will Cross 100k subscribers sir we are with you keep making awesome content

I m fan of ur teaching 😇

great one, the best explanation I have found for knapsack is this one, great work sir.

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!

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.