Microsoft Interview Question: There are n stations and you ... | Glassdoor

Interview Question

Engineer Interview Hyderabad (India)

There are n stations and you have the fairs for travelling

  from one station to the other. How will you find the minimum cost of travelling from s0 to sn, provided you can do (n-1) max hops?

Interview Answer

1 Answer


Isn't this just Dijkstra's Algorithm? Or am I missing something...

Anonymous on Jan 6, 2011

Add Answers or Comments

To comment on this, Sign In or Sign Up.