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 6388Post New Google Software Design AllOther Interview Questions
Define phantom deadlock.
How many rows and columns are there in excel 2010?
Why is hibernate used?
What is the purpose of a parameter?
What are the options to manage the session state in windows azure?
State and define ohm’s law?
Explain link baiting.
Explain about shell aritmetic operators and functions?
How do I run python on windows?
Is it possible to change menu runtime using API? If yes Specify the function names?
Is single load(eg: three phase motor) having all the components like positive,negative,zero sequence components during fault condition?
Explain in detail – inheritance in python?
what is the content of the configuration manager repository?
What are shallow and deep copies?
Is commodities transaction tax a permissible business expenditure? Explain