Backtracking (Think Like a Programmer)

preview_player
Показать описание

This topic was a viewer suggestion--your suggestions for future videos are welcome.

If you want to read more about my programming concepts, check out my "Think Like a Programmer" book. If you've found that you are able to read programs and understand programming language syntax but aren't always confident writing programs from scratch, my book can help.

For more information on the book head to one of these:

Connect with me:
Рекомендации по теме
Комментарии
Автор

"Don't even think about the recursion that's happening. Just imagine you are calling a different, working function" - Best explanation ever. This line lit the lightbulb in my head. Thanks :)

sharadskywalker
Автор

Hope everyone is having a great 2018 so far. This video's topic was viewer suggested. If you have an idea for a future video, let me know!

vantonspraul
Автор

This was amazing, thank you for also not jumping into recursion but instead showing this solution.

justins
Автор

"Not think about the backtracking" - this literally changed my life :D So good!

perstarke
Автор

I was looking for videos on backtracking.. i did not want to waste my time.. so i scrolled many times before i found a video title that talked about "thinking" about backtracking.. well done sir!!

pradpradprad
Автор

I haven't finished the video but right now, I keep thinking about all of the different paths that you can go down, keep thinking about the recursion... and then once you return you go up the path until you can make another decision based off of where you end up but it's just very... complex when you think about it... I mean the base cases do make a lot of sense but the way I'm thinking about it right now is too hard to grasp, it's almost mind bending.

Tyler-jdex
Автор

that Robot analogy was amazing!
Thanks for the video

pranavhegde
Автор

dude - this was the video that actually unlocked the concept of backtracking for me, in a way that I can now start to understand problems going forward. Huge props. I will have to check out your library of videos and i'm not sure if you're still making them but if so I'd love to hear you explain some more concepts. Thanks for making the effort, its much appreciated

johnnosek
Автор

This is one of the best explanations I've ever found. Thanks for making this video :)

ethancox
Автор

You should be a teacher. The way you lay out your thought process in a simple and detailed manner, allows us to replicate that thought process on our own and gain a deep understanding.

bryan
Автор

Thank you so much for creating this video - you explained recursive backtracking in a very easy to understand way, as well as showing the relevant code!

mojo
Автор

this is one of the best explanations I've ever seen. I wish you to keep going on to brush up more information

vidpulse
Автор

Thank you very much!! i dont know why you content underrated. keep making videos good luck!

RishtonKiBaatein
Автор

Best backtracking video I found on youtube.

avatsavirs
Автор

One thing to note is that you only need to keep track of visited because there may be cycles. In his example there are no cycles, so the maze is essentially a tree. There is no possibility of hitting a previously visited node. However, if there was no wall between 2 and 5, keeping track of visited becomes important. I mention this because someone might be looking at the maze and thinking they don't actually need visited, but in the general case, you do.

mixtli
Автор

Can you explain 8 queens problem. I found your explanation and reasoning very clear.

vishalmishra
Автор

You are amazing. You really made backtracking very simple.

snowglider
Автор

really inspiring. I always got confused when I tried to think about backtracking in recursions, now I don't.

tagnetorare
Автор

This channel should create more content. I'm learning a lot.

kishanpatel
Автор

Now i can sleep peacefully knowing that how backtracking thing is working in my code for making different combinations.

himanshududhpuri