Self notes: - Brute Force approach finds all the possible solutions and selects desired solution per given the constraints. - Dynamic Programming also uses Brute Force approach to find the OPTIMUM solution, either maximum or minimum. - Backtracking also uses Brute Force approach but to find ALL the solutions. - Solutions to the Backtracking problems can be represented as State-Space Tree. - The constrained applied to find the solution is called Bounding function. - Backtracking follows Depth-First Search method. - Branch and Bound is also a Brute Force approach, which uses Breadth-First Search method.
Other professors are using complicated examples that are available in reference books, but sir Abdul Bari has created his own simple and easy examples for every topic to teach students.. Thank u sir
I had seen this when I was in second year for getting good marks in university exam and now after two years I am in final year and again watching this to understand the concept and implement in competitive coding . Thank you so much sir 🙏🙏🙏🙏
Cant find a better explanation than this . I wish code corresponding for the problem is also written and explained in your own style so that we can follow that as well !
I am about to complete my midterm exmas syllabus by watching your videoes....thakyou so much sir.......alot of thanks......but one topic left sir..... heap...😞
Thank you for your hard work. Your tutorials are distinguishable and perfect. There is no other place that would teach as easily as you do. You deserve to be listed alongside Linus Torvards :)
Great explanation, i have all study of disign and analysis by watching your videos And my College teacher also reference your videos and teaching in a class.
Backtracking is a general algorithmic technique used for solving problems incrementally by trying out partial solutions and then abandoning them if they are not suitable. It is commonly used in problems that require searching through a large space of possible solutions, such as puzzles, constraint satisfaction problems, and combinatorial optimization problems.
Very nice a learning video sir..we want these type of very informative,deep but easy to understand type videos which can understand anyone..our lots of love and respect for you sir..
just to be clear, backtracking isn't exactly brute force in the sense that we understand it. Backtracking use some conditions in the loop/recursion to not go through the entire process if we know that it won't lead to a solution. In the case of brute force, we will first find all the possible combinations and then use some kind of a function to weed out the results that don't match a certain condition.
sir ji , make videos on segment tree , dp with bitmasking , centroid decomposition , heavy light decomposition , matrix exponentiation and geometrical algorithms like convex hull , line sweep , plane sweep etc. make more videos on advance graphs and trees algorithms. Thanks !
Sir thank you so much for your explanation. I am so impressed and it is very helpful for my studies. can you please teach us how to do forward checking to find the solutions?
Self notes:
- Brute Force approach finds all the possible solutions and selects desired solution per given the constraints.
- Dynamic Programming also uses Brute Force approach to find the OPTIMUM solution, either maximum or minimum.
- Backtracking also uses Brute Force approach but to find ALL the solutions.
- Solutions to the Backtracking problems can be represented as State-Space Tree.
- The constrained applied to find the solution is called Bounding function.
- Backtracking follows Depth-First Search method.
- Branch and Bound is also a Brute Force approach, which uses Breadth-First Search method.
Thank you sir
Thanks anit shrestha manandhar
For this useful information....🙏
Hi
@@villagevibes6472 are you from ddu?
Backtracking is a brute-force subset. Kind of a brute-force early optimization. Dynamic Programming is NOT brute-force because memoization.
Other professors are using complicated examples that are available in reference books, but sir Abdul Bari has created his own simple and easy examples for every topic to teach students..
Thank u sir
You are the best who explained backtracking in just 8 minutes. I lost hours reading and watching and no one explain it easily like you. Thnaks
Wow, I am impressed by his teaching skills. Even a layman could understand the core idea of backtracking
I spend hours and hours in watching recursion and backtracking.. but you made it soo simple..
same
Im watching you from Colombia in 2020! You are the best!
Yeah. No doubt
I'm in India btw
Qué bacano
You deserve to be awarded the best professor award, sir!
One of best lecture of Algorithm on RUclips..thank you sir with bottom of my heart..
Heaven my O!
I had seen this when I was in second year for getting good marks in university exam and now after two years I am in final year and again watching this to understand the concept and implement in competitive coding . Thank you so much sir 🙏🙏🙏🙏
happing same with me .... watching for university exam 😅😅
I maybe 5 years late for commenting but this was the best backtracking exaplaination I found. Thank you so much sir.
Cant find a better explanation than this . I wish code corresponding for the problem is also written and explained in your own style so that we can follow that as well !
That gonna make us more and more dumb.
@@nikhilbadyal have You written evert code by yourself? No
@@vinoddiwan5792 how do you know he has not written?
Wow! This is beyond my expectations... this is simple and elegant .. Thank you so much for providing such great content.
Simply I am saying Thank U very much sir and very deserve personality. May GOD bless him and his family.
Thank you very much!
Your visualization of backtracking is so good.
Thank u Sir...
Thank u so much for your hard work
ALLAH PAK aap se razi hojae....
ALLAH PAK apko jaza e khair ataa kare...
You are one of the best online Tutors i have ever come across
One of the best teachers available for us college students over youtube. Thank you so much sir for all these videos.🥰🥰
bro do you know why did sir left teaching and what he is doing nowadays ? do you have any idea ??
@@souraverdodia2812 He is actually teaching on udemy, you can check his community section about his courses over udemy.
This is the video that truly helped me understand this concept.
I am about to complete my midterm exmas syllabus by watching your videoes....thakyou so much sir.......alot of thanks......but one topic left sir..... heap...😞
sir, you teach so well, and to the point, i like the way to flow the topic , thanks
Dislikes are from college professors who are salty that they cannot explain as well as him
LOL !! True. Dislike out of jealousy
My lecture is very Lazy..he can't explain very well, we are struggling to understand this topic because of him
Hahahahahha trueee
absolutely
Thank you for your hard work. Your tutorials are distinguishable and perfect. There is no other place that would teach as easily as you do. You deserve to be listed alongside Linus Torvards :)
you are one of the best teachers I've known. Thank you so much teacher!
Great explanation, i have all study of disign and analysis by watching your videos And my College teacher also reference your videos and teaching in a class.
Thank you Abdul, your videos have helped me through Data Struct. & Algorithms. Without you I would have failed.
Best lecture ...May Allah bless you sir, Adul Bar
Just realized our teacher watches your videos before teaching us. What a legend
same case
In a few minutes you did it for me. Excellent! Thank you!
Backtracking is a general algorithmic technique used for solving problems incrementally by trying out partial solutions and then abandoning them if they are not suitable. It is commonly used in problems that require searching through a large space of possible solutions, such as puzzles, constraint satisfaction problems, and combinatorial optimization problems.
I am have to tke an exam and with the online school i know nothing, but after tthis i got an idea. TY Abdul
How you are so simple and clear 😁😁
best algo tutorials on youtube.thank you sir
You are an angel, wish every school and institute has a teacher like you.
Wow, totally amazed by the explanation!
Faith in Humanity Restored
Why
Lmao😂
lol
Download humanity.exe file
😂😂
thanks a lot sir for this wonderful vdo ...i m using ur vdos to revise all of my concepts...thanks again
i love your teaching @Abdul Bari
Very clear explanation sir, thank you and keep up the good work! You made my day!
Very clear illustration. You are able to explain the problem, the solution in a simple and easy way. Thank you, sir! Please keep the great work.
Very nice a learning video sir..we want these type of very informative,deep but easy to understand type videos which can understand anyone..our lots of love and respect for you sir..
Hello One of the finest class. One thing you said it but you should have empasized(caps and bold) about posibilities while back tracking.
I really enjoy your explanations, sir!
just to be clear, backtracking isn't exactly brute force in the sense that we understand it. Backtracking use some conditions in the loop/recursion to not go through the entire process if we know that it won't lead to a solution. In the case of brute force, we will first find all the possible combinations and then use some kind of a function to weed out the results that don't match a certain condition.
True, but backtracking is asymptotically equal to brute force even if slightly faster in wall clock time.
Tq sir your teaching was nice and pretty easy to understand.
Very well explained. Deep nd both easy. Itz like we r attending a class 👌😊
This guy helped me through college...now he helps me at my job lol
Was confused to draw recursion trees but this video me alot for understanding that
I love himm he explains so well
best video on Backtracking
You are an incredible teacher, thank you
abdul bari é uma lenda!
Best teacher for Analysis nd design of Algo period!!
such a simple and elegant explanation
simplicity beats complexity!
Appreciation from Bangladesh, Thanks a lot sir
You are a lecture understanding approach is very good. and you have a powerful voice!
This vedio helps so much in this pandemic sir
You are AMAZING!! Thank you so much for everything that you do!!!!!
Moral of the story, never let a girl get between you and your boy.
🤣🤣🤣
😂😂
Great video. It was very easy to understand because of your explanation. Thank you!
love the content but would appreciate if it would have 4x speed option
thx big fan
Dakshita Lal Same
Please please pleaseee
You are awesome explaining complicated things 👏👏
Simple and Elegant
Nice explanation !
Thank You sir
really awesome sir, I love that way of your teaching
Very nice example!
Very good instructor!
Thank you for your hard work.
great video, would have loved you to work through coding this .
great teaching sir
Such a great explanation!
excellent work!!!
Thank you the explanation is so clear
U explain so amazingly
Why sir is not uploading videos nowadays ?,where can I see latest videos,you were my the only teacher, please upload 🙏
Thank you, sir, for such a beautiful video
Woww wonderful teaching sir
careful, he's a hero!
Well explained sir...,..
Thankyou soo much
Only one thing to say- thanks ❤️❤️
Grazie.
Great explained, thank you
Amazing totally loved it!
nicely explained. there is one common problem of printing all possible combinations of a string containing alphabets. Can we use backtracking in it?
Awesome explanation sir.Thank you
sir ji , make videos on segment tree , dp with bitmasking , centroid decomposition , heavy light decomposition ,
matrix exponentiation and geometrical algorithms like convex hull , line sweep , plane sweep etc.
make more videos on advance graphs and trees algorithms.
Thanks !
Sir thank you so much for your explanation. I am so impressed and it is very helpful for my studies. can you please teach us how to do forward checking to find the solutions?
Thanks Sir!! Explanation in simplicity!! :)
Sir thank you so much
This guy is good.
great lesson!
so easily explained
this man just save me on my final tonight right now thank you please make more videos
clear explanation, thanks!
Thank u soo much sir for ur nice explanation
Amazing teacher!
Thanku sir backtracking ka video apka milgya
Awesome explanation. Thank you :)
Long live legend 👑