Perguntas de entrevista para o cargo de Software engineer compartilhadas pelos candidatos
Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.
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.
Maybe you could use Dijkstra's shortest path algorithm.
Both BFS and Dijkstra should work in this case because the edges doesn't have a weight.