Pergunta de entrevista da empresa Oracle

Find optimal path through a matrix like maze with obstacles in it.

Resposta da entrevista

Sigiloso

29 de ago. de 2017

Using modified BFS such that neighbours of the graph correspond to adjacent cells in matrix. Needed to code on paper.