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 Answers   Google,

---

why don't we allow a minimum degree of t=1? in B-tree

4 Answers   TCS,

---

what do you mean by Foreign exchange domain

0 Answers   BoA,

---

How to Design a Good Newsletter?

0 Answers  

---

How can authoring tools support the production of accessible Web content?

0 Answers  

---

Can you explain why software is called a product?

0 Answers   TCS,

---

What is the difference between a web-based and installed software?

1 Answers  

---

what is the difference between generic process model & iterative process model??

0 Answers  

---

Ford Software engineer interview process and model questions

0 Answers   Ford,

---

If Web site developer want to evaluate their current authoring tool, where would they start?

0 Answers  

---

vb.net with Sql sever2005

1 Answers  

---

what is called when you add pixels to a rastered image when you resize?

1 Answers  

---