Microsoft

  www.microsoft.com
Work in HR? Unlock Free Profile

Microsoft Engineer Interview Question

I interviewed in Hyderābād (India) and was asked:
"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?"
Add Tags [?]
Answer

Part of a Engineer Interview Review - one of 3,351 Microsoft Interview Reviews

Answers & Comments

0
of 0
votes
Isn't this just Dijkstra's Algorithm? Or am I missing something...
- Anonymous on Jan 6, 2011

To comment on this question, Sign In with Facebook or Sign Up

Tags are like keywords that help categorize interview questions that have something in common.