4 Principle of Optimality - Dynamic Programming introduction
ฝัง
- เผยแพร่เมื่อ 20 มิ.ย. 2024
- Introduction to Dynamic Programming
Greedy vs Dynamic Programming
Memoization vs Tabulation
PATREON : www.patreon.com/bePatron?u=20...
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-...
Data Structures using C and C++
www.udemy.com/course/datastru...
C++ Programming
www.udemy.com/course/cpp-deep...
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..th-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
please watch this playlist for detailed explanation of dynamic programming..th-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..th-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
use me as respect button
u like to be used as a button 🥲🥲
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..th-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
please watch this playlist for detailed explanation of dynamic programming..th-cam.com/play/PLeF0b8iqbx4mTBJZ5ukIYj92_B4k2L1-8.html..
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!
this was so amazing. Sir you're blessed with incredible teaching skills mash'Allah!
th-cam.com/play/PLzffTJx5aHaT-0K_b47KxScckZfDXAKF3.html
You're the best man! You're saving my life in Algorithms right now. Every video is so clear and simplified. Much appreciated
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
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!
This is the best explanation of Dynamic Programming that I've seen on TH-cam! Thank you Abdul, I subscribed to your channel.
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.
Sir this is so incredible. Thank you for the most simplistic explanation to this. Subscribing for sure
very lucidly explained somewhat complex concepts... really appreciate the effort and insights of the instructor. Great stuff.
only one word for ur effort....RESPECT
Honestly, one of the best teachers I have seen so far
The best thing about your videos is that you cover all aspects of the topic. Love all the videos.
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.
No one can explain it in simpler terms better than you, sir. Thank you
Thank you so much sir! U have uploaded this 4years ago and it's useful for me 2 days before exam !
Excellent presentation, Sir! Thank you very much for this outstanding video.
Always you find a easy way to explain things. This one was the best.
You always have simplicity explanation up in your sleeves. Great. Just keep it up.
I just followed this YT channel before my Design and analysis of algorithm exam and was able to attempt smoothly 😌
Good to see your calming approach in turbulent times....stay blessed...🙏🏻
Sir, thank you sooo much for this clear picture of Greedy vs DP and Memoization vs tabulation
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.
thank you so much sir! I am following your videos for GATE and they are really nice and elaborate!
Dear Sir, You make these complex concepts looks trivial, hats off!
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 😂😂
You are great at explaining the concepts. Keep up the good work!!!!
amazing sir ! kya baat he mahan ho aap. sab students k bleesings apko mil rahe ho apke ache kam k liye
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!
Awesome video! Your explanation is so simple and clear. Thank you Sir
Sir ... Ur the best.... The way of explaining is awesome... Thank u so much sir...
No words to explain your style of teaching. Thanks, Dear! May Allah reward you.
Thanks for explaining in a simple manner
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!!
love your way of teaching and making the problem so obvious with the tree in the beginning. my professor was just showing slides with code and babbling....
dynamic programming work like magic for fibonacci series...... from 2^n to n this is drastic
Concepts and principles are timeless. So are your videos Bari sir. Thank you for making them.
Best explanation of memoization I have ever seen.
Teaching lvl = pro !!!!
amazing confidence while explaining hard topics so easily..
Very crisp and simple explanation .Thanks a lot .
I respect u sir. Ur explanation has always been easy to understand for me . Thanx sir
Thank you for the amazing contribution! Keep posting
the greatest video I have ever seen for algorithm. Thanks very much!
You are too good, you have made knowledge open source... please keep doing it
nice explanation of Memoization. Found very helpful
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
You do great work, my friend. Thank you!
Thank You Sir. Explained in very simple way. Thanks
yes. this is my first video that I watched from you sir. Won't be last.
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
this sir is the goat! 👏Congratulations for your amazing skill of teaching!
Sir. Your videos are really awesome and helped the most. Thank you so much.
Amazing tutorial! Thank you!
if I say that 's the best playlist in algorithm I am not lieing..thanks very much!!
Thanks. Using the tabular methode approach, we easily see why time is theta(n)
Sir u r a legend. best example for a teacher.......
Sir you are best teacher for DSA. Thank you so much sir.
it's amazing thanks so much
جزاك الله خيرا ..
Always love your lectures sir ...
الله يوفق هذا الشخص ويجزاه كل خير
This guy is the ultimate. Fantastic videos.
excellent .. was looking for the exact explanation and got it
You are one of the best DS trainers i know
great way of explanation
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.
You are an awesome teacher. Greetings from Mexico.
Thank you!
sir, your videos are so nice and easy to understand. thank you so much.
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.
I finally understand dynamic programming! thank you sir!
Very helpful in competitive programming ... thanks
Abdul bari is the GOD of Algorithms .Love your way of explaining things in such a simple way.
From Pakistan
You deserve a great respect.
Great Videos! Remarkable. Thank you Sir :)
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
You're an amazing teacher!
So easy explained!!! Thanks alot and keep it up. Please make more videos! Please cover everything in Algorithm!!! :) :)
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++;
:)
mad respect for this guy! thank you!!!
This is impressive, Sir. Keep it up.
This video is awesome tysm sirr it helped me a lot for my xams 😍
These videos are gold.
thanks for the playlist Bari Sir!!..
Quality material. Thank you so much.
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: th-cam.com/video/nqowUJzG-iM/w-d-xo.html
Great ! Salute to U Sir
Such an amazing teacher❣❣
10:30 Excellent Explained Memiozation technique .. Sir :-)
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: th-cam.com/video/nqowUJzG-iM/w-d-xo.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.
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.
Great .. Very well explained.
Sir god bless you.Very nice explanation
Great Lecture!!!
what a great explanation
thank you for the video . please also make a short series for data structures only like this
very nice simple explanation sir,
thanks for sharing
stay bless
Sir u r d best .. very helpful videos ..