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 Kong3 4115
What are the limitations of title and description tags?
What is dynamo?How it works and what is the function of dynamo in a DG.
What is mean by data types in c?
Why is stored procedure faster than query?
What is called Cognos powerplay?
How can I delete old windows?
Which type of energy is the light used in photosynthesis transformed.
What is html lang en?
earth also having a gravitational force (magnetic field of north and south)but it attracts any object compare to this theartifical magnetic cant perform same as earth why?
What are the advantages of using formula in excel sheet?
Which join is like an inner join?
how to size H.T & L.T Panel ?
public class ActionSearchBean extends
What are the benefits of ordbms?
Explain the term reconciliation?