Google Interview Question: Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.

Notifications

Google

Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.

Anonymous

Mar 19, 2015

I tried to solve it using a breadth first search but I couldn't finish write the algorithm, I wasn't very trained at that occasion.

Anonymous

May 11, 2015

Maybe you could use Dijkstra's shortest path algorithm.

Anonymous

Jan 13, 2016

Both BFS and Dijkstra should work in this case because the edges doesn't have a weight.