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 6491Post New Google Software Design AllOther Interview Questions
How we can retrieve data using secondary index. Explain with simple example?
What is Histogram?
Which is the latest Selenium tool?
Which dominates the gasses in the earths atmosphere, making up some 78% of the air by volume?
How can you force the optimizer to use a particular index?
What is sql in dbms?
What is objective c used for?
From semantic point of view of S/4 HANA what are the categories of CDS views?
Explain accessors to a layman.
How do you envision the role of SAP PO evolving in the context of emerging technologies like cloud computing and IoT (Internet of Things)?
internally connection of photvoltic module
What applications work with hacmp?
Do you know what are the steps to process a single select statement?
What is the transaction code to maintain the authorization main switch?
Can annotation extend another annotation?