I would like to submit the following question I was asked recently during my technical interview at Google. I'm rephrasing the question to make it clear for everyone to understand: - You are going on a one-way flight trip that includes billions of layovers. - You have 1 ticket for each part of your trip (i.e: if your trip is from city A to city C with a layover in city B, then you will have 1 flight ticket from city A to city B, and 1 flight ticket from city B to city C. - Each layover is unique. You are not stopping twice in the same city. - You forgot the original departure city. - You forgot the final destination city. - All the tickets you have are randomly sorted. Question are: - Design an algorithm to reconstruct your trip with minimum complexity. - How would you improve your algorithm. Example: - randomly sorted: New York->London San Francisco-> Hong Kong Paris->New York London->San Francisco - sorted: Paris->New York New York->London London->San Francisco San Francisco-> Hong Kong
3 6496Post New Google Software Design AllOther Interview Questions
What does printf does?
Which one is the default transaction factory in hibernate?
In people soft can we delete online page?
Write a code snippet to launch firefox browser in webdriver.
how can I verify that a custom injection filter is working?
Can we null keys in treemap?
How to drop existing views from a database in ms sql server?
How do you check formulas in excel?
Where people codes get stored?
Why do we use href?
What is abstraction example?
Explain about a marketing questionnaire that you have developed?
What are the symptoms of malocclusion?
If I have 3 essential main switch board and 3 incoming electricity ,but only 1 genset running is that possible.
how to create content in drupal?