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 6521Post New Google Software Design AllOther Interview Questions
How do I remove programs from the start menu in windows 10?
What are interactive proofs and zero-knowledge proofs ?
What is the role of schema in the db2 database?
describe what is const pointer and why do we need it?
What is spectral sensitivity?
Define representative elementary volume?
How is deadlock resolved?
How to set NULL values in JDBC PreparedStatement?
why they were using TRIAC instead relay in some controllers and what is the advantages.
What do you understand by mandatory activities?
What is ms excel 2016?
Where caching configuration is stored?
15. Display the item_cost and then truncate it to the nearest hundred, ten, unit, tenth and hundredth.
Have you built any components with actionscript? If so explain how you did it? : adobe flex action script
What mean by topology?