Yesterday, I stumbled across the Veritasium video about The Fastest Maze-Solving Competition on Earth.
The surprising thing he mentioned was the use of DFS and BFS algorithms applied to maze solving (6:28). While I’ve come across DFS as an algorithm with one of its use cases being maze solving, I didn’t expect it to actually be used for this purpose outside of the theoretical realm.
DFS (Depth-First Search) and BFS (Breadth-First Search) are both tree traversal algorithms used extensively in coding interviews.