Video

i was able to solve both problems nearly immediately but i still struggle with problem solving in general, and i already apply these concepts 😔

I have been stuck on the topic of recursion for several days, and now it has finally clicked.

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

6:10

Splendid explanation!

one of the best books i've ever read

Dear CZcams Algorithm, please give me more of these practical SWE videos and less tech influencer garbage

okay iam now in my 40s! Getting my popcorn!

Thanks for making this informative review.

i have a question. how could u make the while loop with conditions iter and foundoutlet terminates because i didn't see anything to trigger its termination here?

I can't believe you're making this available for free. Dude, thank you very, very much.

Isnt using a map or dictionary or hash data structure to store better than using an array?

Something about the aesthetics of that robot remind me of the ISpy books. Thanks for the fun video. It puts the fun in functional.

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.

Thank you for explaining everything a lot more into detail you made it a lot more easier to understand how to line it up I was trying to explain to my 13 year old son and he could not get it I showed him your video and now he understands the game and he love the game so much now thank you so much!!!!

An even better approach is just to make all the right decisions the first time around. Then you never have to backtrack.

Could you show how the list<int> sample_maze is being generated and called in main? When I called the backtrack function sample_maze[9] is empty.

this is great but i wish you could explain the same thing on python :(

Really great video, thanks for giving a non-recursive solution, it helps putting things back in perspective. I'm wondering if this can apply to problems that search for a min/max value? For example, the classic "bag" problem which is traditionally solved using more "combinatory-oriented" approaches. (bag can carry at most N kilos and you have many items worth different values and weights, and you want to find the combination of a minimum items that are worth the maximum amount of gold)

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!!

Was sent here by Sweigart's recursion book!

I think that for problem solving it's also very important to know what actions you can do. For example, in the water problem you can pour from one container to the other. In programming you also need to know what instructions you can do, what commands are available, what APIs you can call, and in general what components/pieces/actions are involved/possible in the problem.

Still didn't get it...😒

I need some serious help. I can understand how this works but I cant come up with a code by myself.

New programmers? Sir, I've been writing code for over 20 years. I flunked this module at college. I even had the book at the time, but I was preoccupied with partying. I always struggled to take what was in my head and put it into a plan. I'd always jump straight in and write a bunch of tests and work from there. It worked sometimes.

Sir,Do you have any online courses?So that anyone can learn in person from you

widce

Goofy ah Mersenne Twister

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

its normal to be more depressed after watching this playlist?

I will just write empty iterative functions and assume it solves the problem for my own satisfaction because I still can't trust recursion. lol. This video helped alot. Thanks!

great to know that there is no little gnome throw the dice in my pc btw what is the game name at 1:14

very instructive! I do really benefit from it!

Keep up the videos!

It's been 4 years since you last uploaded..

Lifesaver! Thanks for this.

Good idea!

I have no experience with Programming whatsoever so I have no idea how this would be executed however I thought for the Dept problem the police number would always be 2,4 or 6 for each of these the sum of the other two has to be either 10, 8 or 6 I wonder if a loop could be coded only for numbers to add to those quantities and be different from one another

Fire #3 , Police #4, Sanitation #5

Your voice sounds like sheldon 😆

Hay quá

This is plain wrong. Software can produce nondeterministic random numbers when the instruction set of the computer has nondeterministic instructions. Every current X86 CPU includes two nondeterministic instructions - RdRand and RdSeed. Software is just an assemblage of CPU instruction and if some the the instructions are nondeterministic then so can the software be nondeterministic.

This helps a tonne thankyou V. Anton

So far I've been lost with all the practice problems because they involve math, but I've been picking up the concepts.

Really well explained, thank you!

This video is very helpful and in the same time exciting 👍🏻

Just found your channel. Thank you for putting amazing teaching content online for free, I would have killed for teachers like you in college.

where can we get the source code?

Python 3.6 released the "secrets" module. It's a secure non-deterministic RNG that is real easy to use. It's just a easy as the "random" module.

The maze problem is basically solved by depth-first search.