ASU Interview Question
Software Engineer / DevelopersTeam: 7
Country: India
Interview Type: Written Test
There are a number of maze solving algorithms. It's not clear from the question, but considering that this is from a programming/coding interview, by "suitable", I am assuming you're looking for the shortest path.
If there are multiple path solutions, breadth-first-search is more suitable finding the shortest path. Another good algorithm is A* algorithm. A* achieves better time performance by using heuristics.
Breadth-first search
- srdjan August 30, 2013