Expedia Group Interview Questions, Process, and Tips

1.5 hours long, platform was hackerearth.

Q1. Reverse a Linked List
Ans. 
Reverse a linked list by changing the pointers direction.
• Start with three pointers: current, previous, and next.

• Iterate through the linked list, updating the pointers to reverse the direction.

• Update the head pointer to the last node to complete the reversal.
Answered by AI
Add your answer

Q1. Hiring manager round
Add your answer
Q2. Questions on previous projects
Add your answer

Q1. Longest subsequence with sum zero
Ans. 
Find the longest subsequence in an array with sum zero.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap along with the index.

• If the same sum is encountered again, the subsequence between the two indices has a sum of zero.
Answered by AI
Add your answer
Q2. Find diameter of tree
Ans. 
The diameter of a tree is the longest path between two leaf nodes in the tree.
• Calculate the longest path between two leaf nodes in the tree

• This can be done by finding the height of the left and right subtrees and adding them together

• The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees
Answered by AI
Add your answer

Q1. System design: Hotel booking system
Ans. 
Design a hotel booking system for managing reservations and availability.
• Use a database to store hotel information, room availability, and reservations.

• Implement user authentication and authorization for booking.

• Include a search feature for users to find available rooms based on their criteria.

• Allow users to make reservations, modify or cancel them.

• Send confirmation emails to users after successful bookings.
Answered by AI
Add your answer

Divide one big integer by another

This round had first questions about behavior, team work and hr type mcq questions.
Then there were 10 computer science mcqs. Then two coding questions.

Q1. This was of 1 hour. He asked about 2-3 dsa questions and some hr questions in last part.
Add your answer

Q1. This was also a similar round like round 2. In this he asked 2 medium dsa questions and some hr questions at last.
Add your answer

Q1. Zigzag level order traversal of tree
Ans. 
Zigzag level order traversal of tree involves traversing the tree level by level in a zigzag pattern.
• Use a queue to perform level order traversal of the tree

• Alternate between left to right and right to left traversal for each level

• Store the nodes at each level in separate arrays
Answered by AI
Add your answer
Q2. Implementation of a vector

Ans. 

A vector is a dynamic array that can resize itself as needed.

• A vector is typically implemented using a dynamically allocated array.

• It provides constant time access to elements using index.

• Vectors can grow in size by reallocating memory when needed.

• Example: vector vec;

• Example: vec.push_back(10);

Add your answer