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 6504Post New Google Software Design AllOther Interview Questions
what the latest software develoment Methodologies?
What is jsp language?
How many ways are there to maintain a state in .net? What is view state?
Define analytics?
Explain me what are the 3 scope levels available in php and how would you define them?
How to discuss the phase shift of transformer considering open delta?
Does nike use magento?
What is axml file?
Is java part of oracle?
Where is teradata rdbms used?
What is the difference between a smart worker and hard Worker.
What are the types of Apache Spark transformation?
What is U'r approach towards a new subject ?
What is 'rbinet'?
what could be the (realtime)bugs you come across in job portal and health care projects in terms of 1. high severity n low priority 2. high severity n high priority 3. low severity n low priority 4. low severity n low priority? pls its very urgent thanks n in advance n lukin forward for reply