You are one of the best teacher i have found online...in my university my respected faculty can teach but her ones might not be so much organized. You make complicated things so simple that I am bit relaxed now...I was panicking as I got my semester final in 2 days and there are so many things to cover...I really need to study and I am lucky and thankful to you and the Almighty that you have uploaded these videos...keep up the good works...not all heroes wear cape.
@@gradientO Yessir, been workin like a slave at Amazon for 2 years. And what I've learned is that money ain't worth your happiness. There, I saved you this FAANG bullshit, now go be happy.
Upto now I seen thousand of video for memoisation, but not ever get clarity. You represent it so nicely, so simply. Thank you sir. much respect from me!
Why they teach us complicated manner? n why are you teaching in simplification manner??Aye Allah apka bahot bahot shukriya k apne aise best teachers free available karwaye mujhe, Aye Allah Abdul Bari sir ko wo tamam khushiyan ata kar..Jo sir ne apse kabhi aapse maangi bhi na ho. Bahot Bahot shukriyah sir..!!
Assalam o alaikum, I am from Dr. Babasaheb Ambedkar Marathwada University, Aurngabad(Maharashtra). Bahot Bahot shukriyah sir for teaching us in such a nice way. Jazak Allah.
Memoization is an optimization process. In simple terms, we store the intermediate results of the solutions of sub-problems, allowing us to speed up the computation of the overall solution. The improvement can be reduced to an exponential time solution to a polynomial time solution, with an overhead of using additional memory for storing intermediate results.
Okay. But how does Dynamic Programming relate to that? And what of tabulation method, is it an optimization too, if so over what? Can the iterative implementation also be memoized? We can check and return the value if it exists in the array to speed it up too. Although, this was not discussed.
When my teacher explains this topic I want to drop out of college! But your explanation is so easy and makes me stay in the college! :) Sir keep posting like these videos 👍👍
Thank you, sir. I have never been so clear about these concepts that share a lot in common: recursion vs memoization vs tabulation vs dynamic programming!
superb superb superb,i have watched the greedy methods algo and from now you are my best teacher in algorithms, thank you so much sir,because of you,i am getting confidence in algorithm subject.
Great video sir!!!. Not only this one but the others also in the algorithm series. I dream if colleges and universities can have teachers like you someday.
Sir love you a lot. Every teacher really hardest method . Just watched your videos 3hours before exam and I went good. Good bless you sir please upload more videos
Sir you are a blessings.🙂 I almost finishing you DSA course in c and c++ on Udemy. May almighty grant you paradise. your teaching is a cure for many of CSE students like us.
The videos are awesome , but I request you to give us a sample of questions related to that topic at the end of the video so that our concept becomes crystal clear. you can reveal the answers of the questions in the next video lecture . This would be of great help to all the students .
Sir you have the gift of breaking down complicated stuff and exposing underlying patterns. If you have time, some day you can try breaking down leetcode problems patterns. Am not suggesting solving all 1000 problems, but just have 10-15 lecture videos summarizing the theory behind multiple problems. Those could cover the most important 200 problems. Rest your students will solve by themselves. IITJEE preparation k baad pehli baar kuch us level ka dekha. Thank you Sir.
The tabulation method of dynamic programming is actually fibonacci in iteration method. In the iteration method, we are only accessing the last 2 values. So this will work: a = 0; b = 1; for(int i = 2; i
Why not memoize the iterative implementation too? We could check for stored values in an array and return them if they exist else do the computation. That way, the results of one computation could be useful in the next one. Can that be called memoization?
As long time follower I would like to say that all of your explanations are top notch! The only thing that I wish you had done differently is the recursion part of Fibonacci. You divide the tree into 2 paths before the first call finishes (while you do say that it takes the left part first, the representation may confuse some students that do not have a solid grasp of recursion). The fib(n-1) should not be drawn until the left hand side is finished.
Fibonacci has indic origin,in fact, not only did Pingala conceptualize the series (what we call as Fibonacci series today) as part of Chanda Shastra, but even extended it to the concept of a pyramid of stacked numbers which we call as “Pascal’s Triangle” today. However, during Pingala’s era, since Mount Meru was commonly used as a reference to the centre of Hindu civilization, he had called his stack of numbers as “Maatra Meru” which he had claimed converges towards the Golden Mean.
Very nicely explained sir! Concepts are well narrated... Thanks so much! This has brought in more interest in learning in depth on this topic and understand few more use case scenario where dynamic programming can be applied.
my teachers see ur videos and explain in the class even though I found it difficult and I gave up on the subject but now I am getting so much interest in topics. I know that this is just because of your simple and cool explanation and the logic behind the complexity is taught clearly to understand the concept. Many Many thanks from all the Viewers sir.
A brilliant definition of principle of optimality found on the internet: "A problem is said to satisfy the Principle of Optimality if the subsolutions of an optimal solution of the problem are themesleves optimal solutions for their subproblems."
Sir, pls check if this summary is right : Greedy Vs Dynamic: 1) both used to solve optimisation problem - find maximum or minimum 2) both start by selecting local optimal value - i.e. global optimum can be obtained by selecting local optimum. 3) But greedy doesn’t change its choice/selection criteria while dynamic can change its choice/selection criteria (Greedy pre-define rule to solve the problem without changing at any step/sequence until final step). This is the main difference between Greedy & Dynamic. 4) optimal solution to the problem contains optimal solution to sub-problems ie. problem can be solved by sequence by sequence - step by step. 5) Greedy may not give correct (optimal) result always but dynamic always give correct (optimal) result.
I am here for the first time on this channel. So far, I've only heard his name and that he teaches so well. Agreed! It was sooo smooth and well done ✅ Subs++; :)
sir, you r videos give me a great help! Thks very much. I'm looking forward to your videos about Compilers & Operating Systems & Computer Architecture & and other computer science courses if possible. Thank you, sir!
I have a doubt sir ! At 11:00 you concluded the time complexity is n . But actually we stored them in array. So we need to search them in array. This may cost more time? Further increasing time complexity ?
So many complex things explained with so simplicity. No words for respect!. Thanks.
Was that topic complex?
please watch this playlist for detailed explanation of dynamic programming..ua-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
please watch this playlist for detailed explanation of dynamic programming..ua-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
@Esca Meredoff me 2
R u bot
This playlist is more useful than my university course, thanks strijderrr
Lol strijder xD, jij bent zeker Nederlands.
please watch this playlist for detailed explanation of dynamic programming..ua-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
use me as respect button
u like to be used as a button 🥲🥲
There's a like button to like and subscribe to respect his teaching.No need buttons from you😅
You are one of the best teacher i have found online...in my university my respected faculty can teach but her ones might not be so much organized. You make complicated things so simple that I am bit relaxed now...I was panicking as I got my semester final in 2 days and there are so many things to cover...I really need to study and I am lucky and thankful to you and the Almighty that you have uploaded these videos...keep up the good works...not all heroes wear cape.
Bari got me an A+ back in my junior year of college, now I'm using his help again when interviewing for a new job. You're the man Abdul Bari!
Passed the interview?
Nope he failed😂😂😂
@@gradientO Yessir, been workin like a slave at Amazon for 2 years. And what I've learned is that money ain't worth your happiness. There, I saved you this FAANG bullshit, now go be happy.
Tell us, pl , did you passed?
@@bakeery yesssiirrr working at a Faang now
You are a great teacher. You explained in 15min what I couldn't understand in a 1 hour lecture. Thank you so much for these videos.
Upto now I seen thousand of video for memoisation, but not ever get clarity. You represent it so nicely, so simply. Thank you sir. much respect from me!
Why they teach us complicated manner? n why are you teaching in simplification manner??Aye Allah apka bahot bahot shukriya k apne aise best teachers free available karwaye mujhe, Aye Allah Abdul Bari sir ko wo tamam khushiyan ata kar..Jo sir ne apse kabhi aapse maangi bhi na ho. Bahot Bahot shukriyah sir..!!
Assalam o alaikum,
I am from Dr. Babasaheb Ambedkar Marathwada University, Aurngabad(Maharashtra).
Bahot Bahot shukriyah sir for teaching us in such a nice way. Jazak Allah.
please watch this playlist for detailed explanation of dynamic programming..ua-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
please watch this playlist for detailed explanation of dynamic programming..ua-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
this was so amazing. Sir you're blessed with incredible teaching skills mash'Allah!
ua-cam.com/play/PLzffTJx5aHaT-0K_b47KxScckZfDXAKF3.html
Honestly, one of the best teachers I have seen so far
Memoization is an optimization process. In simple terms, we store the intermediate results of the solutions of sub-problems, allowing us to speed up the computation of the overall solution. The improvement can be reduced to an exponential time solution to a polynomial time solution, with an overhead of using additional memory for storing intermediate results.
Okay. But how does Dynamic Programming relate to that? And what of tabulation method, is it an optimization too, if so over what? Can the iterative implementation also be memoized? We can check and return the value if it exists in the array to speed it up too. Although, this was not discussed.
Thank you so much sir! U have uploaded this 4years ago and it's useful for me 2 days before exam !
This is the best explanation of Dynamic Programming that I've seen on UA-cam! Thank you Abdul, I subscribed to your channel.
The best thing about your videos is that you cover all aspects of the topic. Love all the videos.
only one word for ur effort....RESPECT
You're the best man! You're saving my life in Algorithms right now. Every video is so clear and simplified. Much appreciated
Probably the best teacher I've ever learned something from... Love from Germany.
I just followed this YT channel before my Design and analysis of algorithm exam and was able to attempt smoothly 😌
Sir this is so incredible. Thank you for the most simplistic explanation to this. Subscribing for sure
No one can explain it in simpler terms better than you, sir. Thank you
When my teacher explains this topic I want to drop out of college! But your explanation is so easy and makes me stay in the college! :) Sir keep posting like these videos 👍👍
So that we can complete our degree without taking drop out 😂😂
if I say that 's the best playlist in algorithm I am not lieing..thanks very much!!
Thank you, sir. I have never been so clear about these concepts that share a lot in common:
recursion vs memoization vs tabulation vs dynamic programming!
Good to see your calming approach in turbulent times....stay blessed...🙏🏻
Teaching lvl = pro !!!!
amazing confidence while explaining hard topics so easily..
Abdul bari is the GOD of Algorithms .Love your way of explaining things in such a simple way.
From Pakistan
Best explanation of memoization I have ever seen.
You are one of the best DS trainers i know
superb superb superb,i have watched the greedy methods algo and from now you are my best teacher in algorithms, thank you so much sir,because of you,i am getting confidence in algorithm subject.
My best teacher too!!
Sir you are best teacher for DSA. Thank you so much sir.
You are an awesome teacher. Greetings from Mexico.
Thank you!
No words to explain your style of teaching. Thanks, Dear! May Allah reward you.
Thank you for explaining in a simple way , i like it.
from Denmark
Abdel Ahmad jo han er virkelig god
Wha bhi acche se nhi pdhate mtlb
Great video sir!!!. Not only this one but the others also in the algorithm series. I dream if colleges and universities can have teachers like you someday.
exam in 1 hour -> this is completely new concept for me tysm...wish me luck
this sir is the goat! 👏Congratulations for your amazing skill of teaching!
yes. this is my first video that I watched from you sir. Won't be last.
Sir love you a lot. Every teacher really hardest method . Just watched your videos 3hours before exam and I went good. Good bless you sir please upload more videos
dynamic programming work like magic for fibonacci series...... from 2^n to n this is drastic
Sir you are a blessings.🙂
I almost finishing you DSA course in c and c++ on Udemy.
May almighty grant you paradise. your teaching is a cure for many of CSE students like us.
I am from one of the Prestigious institution in India. I guess You're the only best teacher I've ever found.
Havard?
@@reykr1846 Haward is Shit.
the greatest video I have ever seen for algorithm. Thanks very much!
GOD ho sir aap literally
you're the reason why teachers are called form of god
He deserves close to 3-4 million subs
Always you find a easy way to explain things. This one was the best.
Abdul Bari is GOD! How can he make things so simple!
Sir u r a legend. best example for a teacher.......
I dream of a day in which I will search for Dymamic Programming tutorials and Fibonacci won't show up
I am a SDE at Flipkart,have a look at my DP playlist that actually landed me a great package job: ua-cam.com/video/nqowUJzG-iM/v-deo.html
I I was thinking the exact thing
@@TheAdityaVerma lol wahi se aaya hun bas idhar
I was looking for the same thing
well he was so many videos in DP this is just an intro in DP video. And actually his algorithm videos are seriously the best.
Excellent presentation, Sir! Thank you very much for this outstanding video.
Concepts and principles are timeless. So are your videos Bari sir. Thank you for making them.
Amazing Sir Amazing Sir
Baqi Tutors ne to sir dard kardia
Aapka Lecture Sun ne k bad sare sar dard khatam
Excellent Sir Excellent
amazing sir ! kya baat he mahan ho aap. sab students k bleesings apko mil rahe ho apke ache kam k liye
very lucidly explained somewhat complex concepts... really appreciate the effort and insights of the instructor. Great stuff.
this is called the genuine teacher ..... 👏👏
I am a SDE at Flipkart,have a look at my DP playlist that actually landed me a great package job: ua-cam.com/video/nqowUJzG-iM/v-deo.html
Sir ... Ur the best.... The way of explaining is awesome... Thank u so much sir...
You are too good, you have made knowledge open source... please keep doing it
The videos are awesome , but I request you to give us a sample of questions related to that topic at the end of the video so that our concept becomes crystal clear. you can reveal the answers of the questions in the next video lecture . This would be of great help to all the students .
Sir you have the gift of breaking down complicated stuff and exposing underlying patterns.
If you have time, some day you can try breaking down leetcode problems patterns. Am not suggesting solving all 1000 problems, but just have 10-15 lecture videos summarizing the theory behind multiple problems. Those could cover the most important 200 problems. Rest your students will solve by themselves.
IITJEE preparation k baad pehli baar kuch us level ka dekha. Thank you Sir.
I don't know but Abdul is a CHAD. THANKS SO MUCH!
Just don't how to appreciate this work 🙇♂
Dear Sir, You make these complex concepts looks trivial, hats off!
The tabulation method of dynamic programming is actually fibonacci in iteration method.
In the iteration method, we are only accessing the last 2 values. So this will work:
a = 0; b = 1;
for(int i = 2; i
Why not memoize the iterative implementation too? We could check for stored values in an array and return them if they exist else do the computation. That way, the results of one computation could be useful in the next one. Can that be called memoization?
10:30 Excellent Explained Memiozation technique .. Sir :-)
thank you so much sir! I am following your videos for GATE and they are really nice and elaborate!
This guy is the ultimate. Fantastic videos.
This should be at the top of the yt search
This is one of the best playlist for algorithms. Thank you sir!!
As long time follower I would like to say that all of your explanations are top notch!
The only thing that I wish you had done differently is the recursion part of Fibonacci. You divide the tree into 2 paths before the first call finishes (while you do say that it takes the left part first, the representation may confuse some students that do not have a solid grasp of recursion). The fib(n-1) should not be drawn until the left hand side is finished.
Fibonacci has indic origin,in fact, not only did Pingala conceptualize the series (what we call as Fibonacci series today) as part of Chanda Shastra, but even extended it to the concept of a pyramid of stacked numbers which we call as “Pascal’s Triangle” today. However, during Pingala’s era, since Mount Meru was commonly used as a reference to the centre of Hindu civilization, he had called his stack of numbers as “Maatra Meru” which he had claimed converges towards the Golden Mean.
Nice nice 👍 my teacher learn from your technique and give lecture in class
I respect u sir. Ur explanation has always been easy to understand for me . Thanx sir
Thank you sir! I owe my CS Degree to you
Very nicely explained sir! Concepts are well narrated... Thanks so much! This has brought in more interest in learning in depth on this topic and understand few more use case scenario where dynamic programming can be applied.
rock star of the programming teaching world
idk who disliked, but your'e the best sir :)
my teachers see ur videos and explain in the class even though I found it difficult and I gave up on the subject but now I am getting so much interest in topics.
I know that this is just because of your simple and cool explanation and the logic behind the complexity is taught clearly to understand the concept.
Many Many thanks from all the Viewers sir.
You always have simplicity explanation up in your sleeves. Great. Just keep it up.
When i reached Dynamic Algortihm i wanted o stop learning informatik , but now i hae an ideer of what is it thx for all Sir
A brilliant definition of principle of optimality found on the internet:
"A problem is said to satisfy the Principle of Optimality if the subsolutions of an optimal solution of the problem are themesleves optimal solutions for their subproblems."
Thank you sir
You gave a hope to crack my sem exams
In one word you are awesome
Very crisp and simple explanation .Thanks a lot .
I finally understand dynamic programming! thank you sir!
Sir, pls check if this summary is right :
Greedy Vs Dynamic:
1) both used to solve optimisation problem - find maximum or minimum
2) both start by selecting local optimal value - i.e. global optimum can be obtained by selecting local optimum.
3) But greedy doesn’t change its choice/selection criteria while dynamic can change its choice/selection criteria (Greedy pre-define rule to solve the problem without changing at any step/sequence until final step). This is the main difference between Greedy & Dynamic.
4) optimal solution to the problem contains optimal solution to sub-problems ie. problem can be solved by sequence by sequence - step by step.
5) Greedy may not give correct (optimal) result always but dynamic always give correct (optimal) result.
Sir, thank you sooo much for this clear picture of Greedy vs DP and Memoization vs tabulation
I am here for the first time on this channel. So far, I've only heard his name and that he teaches so well.
Agreed!
It was sooo smooth and well done ✅
Subs++;
:)
a gold mine in youtube
itna acha samjhaty hain ap sir main to ap ki he videos dekhti hu God Bless you
mash'Allah!
amazing sir 💙
Congratulation on 500K reaching sir
Thanks Sampath
for relation T(n)=2T(n-1)+1 we can't use masters theorem as b=1. 6:14
sir, you r videos give me a great help! Thks very much. I'm looking forward to your videos about Compilers & Operating Systems & Computer Architecture & and other computer science courses if possible. Thank you, sir!
الله يوفق هذا الشخص ويجزاه كل خير
Great ! Salute to U Sir
Sir. Your videos are really awesome and helped the most. Thank you so much.
I have a doubt sir ! At 11:00 you concluded the time complexity is n . But actually we stored them in array. So we need to search them in array. This may cost more time? Further increasing time complexity ?
nice explanation of Memoization. Found very helpful
Such an amazing teacher❣❣
You are great at explaining the concepts. Keep up the good work!!!!
wow amazing very nice i am from pakistan . love you
Awesome video! Your explanation is so simple and clear. Thank you Sir