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.
@bhagyashrikumbar99005 жыл бұрын
Thank you sir
@sauravkumar75085 жыл бұрын
Thanks anit shrestha manandhar For this useful information....🙏
@villagevibes64724 жыл бұрын
Hi
@munafdivan38823 жыл бұрын
@@villagevibes6472 are you from ddu?
@willoyd3 жыл бұрын
Backtracking is a brute-force subset. Kind of a brute-force early optimization. Dynamic Programming is NOT brute-force because memoization.
@12Saqlain3 жыл бұрын
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
@ivybrandyn29 күн бұрын
I haven't seen you in so long! You got me through college years ago and now I'm a computer vision engineer in robotics. Hope you're proud
@ParthKoli-m7x3 күн бұрын
hey there:)
@vaibhavtiwari60303 күн бұрын
@ParthKoli-m7x hi here
@oscaranillo71314 жыл бұрын
Im watching you from Colombia in 2020! You are the best!
@govind227034 жыл бұрын
Yeah. No doubt
@govind227034 жыл бұрын
I'm in India btw
@ilyabikmeev3 жыл бұрын
Qué bacano
@YasserSinjab4 жыл бұрын
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
@yousufborno38753 жыл бұрын
Wow, I am impressed by his teaching skills. Even a layman could understand the core idea of backtracking
@SenthilKumar-ji5wu4 жыл бұрын
I spend hours and hours in watching recursion and backtracking.. but you made it soo simple..
@aryanbarodwal94982 ай бұрын
same
@phillipuchen3 жыл бұрын
You deserve to be awarded the best professor award, sir!
@Maheshkumarsc5 жыл бұрын
One of best lecture of Algorithm on KZbin..thank you sir with bottom of my heart..
@ytg66634 жыл бұрын
Heaven my O!
@edensexile582 Жыл бұрын
I maybe 5 years late for commenting but this was the best backtracking exaplaination I found. Thank you so much sir.
@elisadistante35119 ай бұрын
Grazie.
@srinathakarur97983 жыл бұрын
Simply I am saying Thank U very much sir and very deserve personality. May GOD bless him and his family.
@abdulrahmanmustapha74863 жыл бұрын
You are one of the best online Tutors i have ever come across
@RohitKumar-dz8dh2 жыл бұрын
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 🙏🙏🙏🙏
@crescent40332 жыл бұрын
happing same with me .... watching for university exam 😅😅
@sheeprambeta32173 жыл бұрын
Dislikes are from college professors who are salty that they cannot explain as well as him
@contactdi84263 жыл бұрын
LOL !! True. Dislike out of jealousy
@melissagblinwon98382 жыл бұрын
My lecture is very Lazy..he can't explain very well, we are struggling to understand this topic because of him
@جمهوريةخرى Жыл бұрын
Hahahahahha trueee
@arjumandwani73928 ай бұрын
absolutely
@rafaelnegron56623 жыл бұрын
This is the video that truly helped me understand this concept.
@yizhang70273 жыл бұрын
Thank you very much! Your visualization of backtracking is so good.
@KrishnaKumar-lb6yw5 жыл бұрын
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 !
@nikhilbadyal5 жыл бұрын
That gonna make us more and more dumb.
@vinoddiwan57924 жыл бұрын
@@nikhilbadyal have You written evert code by yourself? No
@satyamgaba4 жыл бұрын
@@vinoddiwan5792 how do you know he has not written?
@12Saqlain3 жыл бұрын
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...
@mahammadkhalilov17004 жыл бұрын
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 :)
@harshitsharma1905 Жыл бұрын
One of the best teachers available for us college students over youtube. Thank you so much sir for all these videos.🥰🥰
@souraverdodia2812 Жыл бұрын
bro do you know why did sir left teaching and what he is doing nowadays ? do you have any idea ??
@harshitsharma1905 Жыл бұрын
@@souraverdodia2812 He is actually teaching on udemy, you can check his community section about his courses over udemy.
@x.07264 жыл бұрын
Wow! This is beyond my expectations... this is simple and elegant .. Thank you so much for providing such great content.
@minhphong54182 жыл бұрын
you are one of the best teachers I've known. Thank you so much teacher!
@jaidevgatla968510 ай бұрын
sir, you teach so well, and to the point, i like the way to flow the topic , thanks
@ShriTech-mp7pv4 жыл бұрын
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.
@aashishgoyal14366 жыл бұрын
best algo tutorials on youtube.thank you sir
@sachinshilwal713 жыл бұрын
Just realized our teacher watches your videos before teaching us. What a legend
@melvinkimathi89243 жыл бұрын
same case
@csspms79703 жыл бұрын
Best lecture ...May Allah bless you sir, Adul Bar
@aqsa71416 жыл бұрын
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...😞
@jewwantcady3 жыл бұрын
In a few minutes you did it for me. Excellent! Thank you!
@sain3352 Жыл бұрын
Thanks!
@ABHISHEKYADAV-mj8yi6 жыл бұрын
Faith in Humanity Restored
@ytg66634 жыл бұрын
Why
@dipanshumishra89013 жыл бұрын
Lmao😂
@tanujmanral4863 жыл бұрын
lol
@testloop10483 жыл бұрын
Download humanity.exe file
@marshal71153 жыл бұрын
😂😂
@PINKIKUMARI-zh8yj6 жыл бұрын
i love your teaching @Abdul Bari
@austincarrowraces90804 жыл бұрын
Thank you Abdul, your videos have helped me through Data Struct. & Algorithms. Without you I would have failed.
@umarrehankhan63504 ай бұрын
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.
@finnex531624 күн бұрын
This is very clear, thank for this, professor!!
@DineshKumar-lq2ck4 жыл бұрын
You are an angel, wish every school and institute has a teacher like you.
@chinmaydas40536 жыл бұрын
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..
@Stella-se1lg6 жыл бұрын
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.
@eccheong2 жыл бұрын
Very clear explanation sir, thank you and keep up the good work! You made my day!
@gurjotsinghpandher39083 ай бұрын
Wow, totally amazed by the explanation!
@neerajmahapatra52392 жыл бұрын
How you are so simple and clear 😁😁
@vrindatiwari39254 жыл бұрын
thanks a lot sir for this wonderful vdo ...i m using ur vdos to revise all of my concepts...thanks again
@victoranghel79653 жыл бұрын
I am have to tke an exam and with the online school i know nothing, but after tthis i got an idea. TY Abdul
@Joangiemarquez4 жыл бұрын
I really enjoy your explanations, sir!
@samirkumarpadhi2 жыл бұрын
Hello One of the finest class. One thing you said it but you should have empasized(caps and bold) about posibilities while back tracking.
@inversemetric4 жыл бұрын
You are an incredible teacher, thank you
@brunospring1130 Жыл бұрын
abdul bari é uma lenda!
@amerdelic87102 жыл бұрын
Moral of the story, never let a girl get between you and your boy.
@Nameiscantsay6 ай бұрын
🤣🤣🤣
@prashantsalhanvlogs23732 ай бұрын
😂😂
@OverLordOfDa3rdWorld2 жыл бұрын
You are AMAZING!! Thank you so much for everything that you do!!!!!
@shammya94466 жыл бұрын
Appreciation from Bangladesh, Thanks a lot sir
@syedchand9956 жыл бұрын
Very well explained. Deep nd both easy. Itz like we r attending a class 👌😊
@andrewcenteno3462 Жыл бұрын
This guy helped me through college...now he helps me at my job lol
@shruthirekha60973 жыл бұрын
Tq sir your teaching was nice and pretty easy to understand.
@hotaru67656 жыл бұрын
Best teacher for Analysis nd design of Algo period!!
@Tommy-dd5pz4 жыл бұрын
Such a great explanation!
@ArjunSingh-ew6ob Жыл бұрын
best video on Backtracking
@abhiireddy64 жыл бұрын
such a simple and elegant explanation
@FantaPopRockz Жыл бұрын
I love himm he explains so well
@gowtham123652 ай бұрын
Anyone in 2024😅
@BaveshChowdary2 ай бұрын
Two days before exam
@uttamkarmakarece35343 жыл бұрын
Was confused to draw recursion trees but this video me alot for understanding that
@rutustup3964 жыл бұрын
You are awesome explaining complicated things 👏👏
@AmitKumar-cf9zh6 жыл бұрын
really awesome sir, I love that way of your teaching
@poojamundluru44604 жыл бұрын
This vedio helps so much in this pandemic sir
@AmolAghav4 жыл бұрын
Great video. It was very easy to understand because of your explanation. Thank you!
@jhguygih2 жыл бұрын
How do I calculate number os possible solutions when I have a constraint. I mean, how equation would give us 4 on the second scenario. Would it be, 2x1x2 where the options are boy or a girl?
@chiranjeevisaride4 жыл бұрын
Amazing totally loved it!
@MK1850544 жыл бұрын
simplicity beats complexity!
@SourovDattacse5 жыл бұрын
You are a lecture understanding approach is very good. and you have a powerful voice!
@mohammedadel89482 жыл бұрын
Thank you for your hard work.
@antbyron5 жыл бұрын
Very good instructor!
@rajat15486 жыл бұрын
Thank you, sir, for such a beautiful video
@shivadityameduri99732 жыл бұрын
Very nice example!
@EmnaGHARBI215 жыл бұрын
Thank you the explanation is so clear
@chenghongyu6263 жыл бұрын
excellent work!!!
@rakeshsonti6 жыл бұрын
Well explained sir...,.. Thankyou soo much
@raffayhussain67172 жыл бұрын
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.
@abyszero86202 жыл бұрын
True, but backtracking is asymptotically equal to brute force even if slightly faster in wall clock time.
@shrangisoni87586 жыл бұрын
Sir i heard that branch n bound technique can use dfs, bfs and Least count..
@ramankumar41 Жыл бұрын
Nice explanation !
@pradeepmondal49434 жыл бұрын
U explain so amazingly
@namangupta95824 жыл бұрын
Only one thing to say- thanks ❤️❤️
@awalktoinfinity6656 жыл бұрын
Sir..yha jo B1 , B2 ,G1 (those 3 students) hai wo unko edges represent kr rhi h ya nodes when you were generating tree ??
@awalktoinfinity6656 жыл бұрын
@@abdul_bari oh.. thank you so much sir.. Instant reply .. i really appreciate that . Toh sir nodes yha kya represent krr rhi hai ???
@gawarivivek4 жыл бұрын
Thanks Sir!! Explanation in simplicity!! :)
@james37424 жыл бұрын
Fantastic job! Thank you.
@muhammadrashadyusuf543 Жыл бұрын
Simple and Elegant
@rcopeland9994 жыл бұрын
clear explanation, thanks!
@roccosen33316 жыл бұрын
Amazing teacher!
@silmendor4 жыл бұрын
Great explained, thank you
@vivekach16 жыл бұрын
Awesome explanation. Thank you :)
@madhumithagannavaram76083 жыл бұрын
def powerSet(string , index , curr): # string : Stores input string # curr : Stores current subset # index : Index in current subset, curr if index == len(string): print(curr) return powerSet(string, index + 1, curr + string[index]) powerSet(string, index + 1, curr) Sir, above is the code for power set of all strings possible will u please explain this example
@azeeztaiwo28024 жыл бұрын
great video, would have loved you to work through coding this .
@ShubhamSingh-lu1gy4 жыл бұрын
careful, he's a hero!
@jasonsong12996 ай бұрын
Can someone explain to me why must I do bounding function when the girl is at the second node?
@koffithegreat6 жыл бұрын
this man just save me on my final tonight right now thank you please make more videos
@mandilal946 жыл бұрын
Awesome explanation sir.Thank you
@dakshitalal28984 жыл бұрын
love the content but would appreciate if it would have 4x speed option thx big fan
@keerathpreetsingh35064 жыл бұрын
Dakshita Lal Same
@quantagupta14944 жыл бұрын
Please please pleaseee
@varunmishra83895 жыл бұрын
Sir, What are Explicit and Implicit Constraints in Backtracking...???
@airel4295 жыл бұрын
Sir i have a question where to find the code to solve the question below? Solve TSP using brute force approaches (produce state space tree). Develop complete code and calculate time complexity.
@girl-qr9oh6 ай бұрын
❤thank you soooooooooo muchhhhhhhhhhhh.... idk how to thank you enough