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 5285Post New Google Software Design AllOther Interview Questions
What is the result of not creating the employee in the database whereas the employee exists in Siebel application ?
what is the difference between a web-garden and a web-farm? : Sql dba
Why is batch record important?
What are the disadvantages of java sockets?
If RDBMS is halted what will you do ?
Will windows 95 games work on windows 10?
How can you say that a template is better than a base class?
wha is Adsorption column chromatography?
How does sharepoint work?
What are the steps to create DB connect?
What do you mean by cash credit?
What are the main cultural reasons in the change of fashion?
What is a lightweight component?
Are the expected value and mean value different?
Is android 4.0 still supported?