Pergunta de entrevista da empresa Google

Given a grid of points, give an algorithm to minimize the distance between two points.

Respostas da entrevista

Sigiloso

31 de mai. de 2013

If I understand the question correctly, this should be solvable with A* or Dijkstra.

Sigiloso

11 de out. de 2013

the shortest distance between two points is the eucledian distance, is this what you were referring too? double d = Math.sqrt(Math.pow(x1-y1,2) - Math.pow(x2-y2,2));