Asked about Trees, graphs and the rest
What is the difference between recursion and backtracking?
An answer that works
Backtracking is recursion that undoes its choice before trying the next one. The undo step, usually a pop, is what makes it backtracking, and forgetting it is the most common bug in these problems.
Reading an answer is not being able to give one. The section that teaches this is Trees, graphs and the rest, 16 hours of Data structures & algorithms.
Learn this properlyAlso asked about Data structures & algorithms
Do AI engineering roles still ask algorithm questions?How do you decide how much algorithm preparation to do?When do you reach for a hash map?How do you recognise a sliding window problem?What is binary search on the answer?What is a monotonic stack for?When would you use BFS rather than DFS?How do you find the top k elements efficiently?
All 13 questions on Data structures & algorithms