Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Expedia Interview | Set 4 (On-Campus)

  • Difficulty Level : Medium
  • Last Updated : 15 Sep, 2014

My Expedia Experience:-

Online Test:-
MCQs on almost all topics (DS, Algo, C, C++, OS, DBMS, Quant, Verbal)
2 coding problems:-
1. Rat in a maze(Basic Recursion Problem).
2. Given a undirected graph check whether it is a tree or not(Easy BFS problem).

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

F2F Technical Interview Round 1(40 Mins):
-Very Long and depth discussion on Projects.
-Discussion about some google products implementation :(.
-Given Inorder and Preoder Traversal of a binary tree, Construct the Binary Tree.(Complete code with all boundary Conditions needed).

F2F Technical Interview Round 2(40 mins):
-Discussion on projects(Asked to dry run the algo used)
-Process and Threads ?
-Semaphores Implementation + Some Basic OS Questions(Critical Sections etc)
-Solve Reader Writer Problem with Semaphores(Code was needed :P)
-Given a tree, print rightmost nodes.(I said, it can be done using Level Order Traversal and printing the Last node at each Level,
then he asked to write the code for it).
-Implement Queue With 2 stacks
-Some More Questions on another projects.

F2f HR(60 mins) :
-Many Questions on different practical situations, and asked for my reaction to them.
-Find top 3 records from an employee table.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up
Recommended Articles
Page :