Asked about Trees, graphs and the rest
When would you use BFS rather than DFS?
An answer that works
When the question involves levels, or the shortest path in an unweighted graph, since BFS reaches nodes in order of distance. DFS suits paths, subtree properties and anything naturally recursive.
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?How do you find the top k elements efficiently?What does topological sort solve?
All 13 questions on Data structures & algorithms