Google Interview Question
Web:
www.google.com
|
HQ:
Mountain View, CA
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
1,069 Interview Reviews |
Back to all Google Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Software Engineer at Google:
Aug 12, 2009
1 of
1 people found this helpful
Implement on a board a shortest path algorithm when traveling from point A to point B on a board. Once you produce a solution, they throw modifications to an initial problem like what if you know that points x, y, z cannot be used in a path.
Add Tags
[?]
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (2)
1 of 1 people found this helpful
Aug 29, 2009
This can be solved using SPF (Shortest Path First) or Dijkstra's Algorithm. If some points are excluded then it is solved using CSPF (Constraint Shortest Path First) algorithm. Make the cost of the points excluded infinity then apply SPF.
Helpful Answer?
Yes |
No
Inappropriate?
Members can
answer or comment on this question
–
Join Now (It's Free) or
Sign In
You might also be interested in: Interview Questions, Software Engineer Interview Questions, Google Interview
0 of 4 people found this helpful
by Interview Candidate: