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 6379Post New Google Software Design AllOther Interview Questions
How do I sum and ignore #value in excel?
if the source have total 15 records with 2 records are updated and 3 records are newly inserted at the target side we have to load the newly changed and inserted records
Contrast the streak plate isolation and pour-plate isolation methods for making population measurements?
What is the difference between local storage & session storage?
What do you mean by coinbase transaction?
Explain the Important tcodes in ALE Idocs?
Explain traceability matrix?
How to release all resources file from the QTP?
How is message oriented middleware responsible for no time dependency between sender and receiver component with respect to point to point model on jms?
Can abstract class have private constructor?
What do you mean by bootstrap well?
What about the year gap criteria for HCL technology?
Define satellite assembly in c#?
Why should we use data ware housing and how can you extract data for analysis with example?
Define iframe in html.