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 6338Post New Google Software Design AllOther Interview Questions
What were the awards given to rakesh sharma?
What is ng-content directive in angular?
How do you rank data in excel?
What stateless linux server?
What is sp_helptext?
What are the factors involved in influencing the crime?
What is encapsulation in ios?
How do you update a table?
How can you Navigate from the DHTML application to another DHTML application? .
How to handle the exceptions using recovery secnario manager in quicktest professional?
How to use tomcat jndi datasource in a spring web application?
What do you mean by foreign key and primary key?
You have to store user responses of ‘yes’ and ‘no’ what kind of data type is best suited for this task?
What are the operating systems supported by selenium webdriver?
What is the difference between directive include and jsp include?