Pergunta de entrevista da empresa Google: Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.

Google

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

Sigiloso

19 de mar. de 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.

Sigiloso

11 de mai. de 2015

Maybe you could use Dijkstra's shortest path algorithm.

Sigiloso

13 de jan. de 2016

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