Pergunta de entrevista da empresa Microsoft

Find exist in maze or prove its non existence.

Respostas da entrevista

Sigiloso

24 de mar. de 2009

You need to write a code for finding shortest path in maze. For a recursion use call stack.

Sigiloso

6 de mai. de 2009

Keep an structure (array / binari Tree/ hash table) to "remember" if a "node" has been use to avoid loop. Building a graph and nodes to navigate trough the maze and track back on your node until you reach your first node that have no more "start node" or you have found the "exit node"

1