Expedia Group Interview Questions, Process, and Tips

Q1. Basic coding and sql
Add your answer

Q1. Big data and system design
Add your answer

Q1. Hiring manager round
Add your answer

Q1. Prefer not to due to NDA
Add your answer

Brush up on DS and Algorithms

Round duration - 90 minutes
Round difficulty - Easy

The round was conducted on the HackerRank platform. It was conducted in the morning from 12:00 pm to 1:30 pm.
The only requirement was a stable internet connection.

Q1. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
The task is to determine if a given string of parentheses is balanced or not.
• Use a stack data structure to keep track of opening parentheses.

• Iterate through the string and push opening parentheses onto the stack.

• When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis.

• If the stack is empty at the end or there are unmatched parentheses, the string is not b
Answered by AI
Add your answer
Q2. 
Date Reformatting
You have a string 'S' representing a date in the "Day Month Year" format, where:
• Day is one of {"1st", "2nd", "3rd", ..., "29th", "30th", "31st"}.
• Month is one of {"Jan", "Feb", "M...read more
Ans. 
Reformat dates from 'Day Month Year' format to 'YYYY-MM-DD' format.
• Parse the input string to extract day, month, and year.

• Convert month to its numerical equivalent (e.g., 'Jan' to '01').

• Format the date in 'YYYY-MM-DD' format and output.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was conducted in the morning, at around 8 am, and was conducted on the Blue Jeans Platform. It was an online video interview, where the interviewer asked me 2 questions related to DSA.

Q1. 
Distinct Islands Problem Statement
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...read more
Ans. 
Count the number of distinct islands in a 2D array of 0s and 1s.
• Identify connected groups of 1s to form islands

• Check if islands can be translated to overlap without rotation or reflection

• Count the number of distinct islands based on the above criteria
Answered by AI
Add your answer
Q2. 
Count and Say Sequence Problem
The 'Count and Say' sequence is a series of strings in which each consecutive term is generated by describing the previous term. The sequence begins with '1'.
Your task is ...read more
Ans. 
Implement a function to determine the 'Count and Say' sequence after N iterations.
• Iterate through each term in the sequence, describing the previous term to generate the next term.

• Use a count to keep track of consecutive digits and append the count and digit to the result string.

• Repeat this process for N iterations to get the sequence after N iterations.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This round was conducted after the first round in the morning. It was conducted at 10:00 am.

Q1. 
Distribute Items Problem Statement
Calculate the number of ways to distribute a given number of items 'N' among three people such that each person gets at least one item, and only one person receives the ...read more
Ans. 
Calculate the number of ways to distribute items among three people with constraints.
• Start by distributing one item to each person, then distribute the remaining items to one person.

• Use combinatorics to calculate the number of ways to distribute the remaining items to one person.

• Consider edge cases like when N is less than 3 or when N is equal to 3.

• Example: For N=7, distribute 1 item to each person and then distribute
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This was an HR round and was conducted on the same day at around 12:00 pm

Round duration - 75 minutes
Round difficulty - Medium

This round was carried out on Amcat. It was very user friendly platform and easily understandable. Countdown Timer was located at the top right corner that helped me to keep a check on the remaining time and I planned my answers and code accordingly.

Q1. 
Position of Right Most Set Bit
Determine the position of the rightmost set bit in the binary representation of a given number N.
Input:
T: Number of test cases
N: An integer for which the position of the...read more
Ans. 
Find the position of the rightmost set bit in a given number's binary representation.
• Convert the number to binary representation.

• Find the position of the rightmost set bit by counting from right to left.

• Return the position of the rightmost set bit.
Answered by AI
Add your answer
Q2. 
Ninja's Jump Task
The Ninja has been given a challenge by his master to reach the last stone. These stones are represented as an array of numbers. The Ninja can jump using either odd-numbered or even-numb...read more
Ans. 
Find the number of starting indices from which a Ninja can reach the last stone by following specific jump rules.
• Iterate through the array and keep track of the possible jumps for each index based on the rules provided.

• Use dynamic programming or a stack to efficiently calculate the number of starting indices.

• Consider edge cases where some indices may have no possible jumps.

• Example: For the input [10, 13, 12, 14, 15], t...read more
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

This round was conducted on Hirevue platform which is a flexible and easy to use.

Q1. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
• Use dynamic programming to solve the problem efficiently.

• Define a recursive function to calculate the number of ways to reach each stair.

• Consider base cases for 0 and 1 stairs.

• Use memoization to store intermediate results and avoid redundant calculations.

• Return the result modulo 10^9+7 to handle large values.
Answered by AI
Add your answer

Round duration - 35 minutes
Round difficulty - Medium

This round lasted for almost half an hour and I enjoyed the conversation.

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

Q1. Given a problem statement and a code, how would you find and correct the bugs in the code?
Ans. 
To find and correct bugs in code, analyze problem statement, review code, use debugging tools, run test cases, and make necessary changes.
• Understand the problem statement and expected output

• Review the code for syntax errors, logical errors, and potential bugs

• Use debugging tools like breakpoints, print statements, and IDE features

• Run test cases to identify the bugs and verify the corrections

• Make necessary changes to the
Answered by AI
Add your answer
Q2. 
Count Nodes within K-Distance Problem Statement
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...read more
Ans. 
Count the number of nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
• Create a graph using the given vertices and edges.

• Perform a BFS traversal starting from each marked node to find nodes within K-distance.

• Count the nodes within K-distance from all marked nodes and return the total count.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Problem Statement: Largest Subarray with Equal Number of 0s and 1s
Given an array containing only 0s and 1s, determine the length of the longest contiguous subarray that has an equal number of 0s and 1s.
...read more
Ans. 
Find the length of the longest subarray with equal number of 0s and 1s in a given array of 0s and 1s.
• Iterate through the array and maintain a running count of the difference between the number of 0s and 1s encountered so far.

• Store the count values in a hashmap with the index as the key.

• If the same count is encountered again, calculate the length of the subarray between the two occurrences.

• Return the maximum length foun
Answered by AI
Add your answer
Q2. Can you explain how the file system is stored on a disk and how it works?
Ans. 
File system is stored on disk using data blocks and metadata, organized in a hierarchical structure.
• File system is stored on disk using data blocks and metadata

• Data blocks contain actual file data, while metadata stores information about files and directories

• File system is organized in a hierarchical structure with directories containing files and subdirectories

• File system uses a file allocation table (FAT) or an index
Answered by AI
Add your answer
Q3. Can you distinguish between RISC and CISC architectures?
Ans. 
RISC focuses on simplicity and efficiency, while CISC emphasizes complex instructions and flexibility.
• RISC uses a small set of simple instructions, while CISC uses a large set of complex instructions.

• RISC architectures have a uniform instruction format, while CISC architectures have variable-length instructions.

• RISC architectures rely on optimizing compilers for performance, while CISC architectures have hardware optim...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.

Round duration - 90 minutes
Round difficulty - Medium

This round had 2 coding questions. In both of them, You need to implement those functions such that it returns the correct answer based on what the problem is about.

Q1. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Return elements with count greater than 1 as duplicates.

• Time complexity can be optimized to O(N) using a HashSet to store seen elements.
Answered by AI
Add your answer
Q2. 
Version Comparison
Given two strings, Version1 and Version2, each representing version numbers, determine which one is the latest version.
Explanation:
The input strings consist of digits and dots only....read more
Ans. 
Compare two version numbers to determine the latest version.
• Split the version numbers by '.' and compare each part from left to right.

• If a part in Version2 is greater than the corresponding part in Version1, Version2 is the latest.

• Handle cases where one version number has more parts than the other.

• Return 1 if Version1 is the latest, -1 if Version2 is the latest, and 0 if they are the same.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

The Interviewer has 5 years of experience and was very friendly. He introduced himself first and asked me for a quick introduction. Then he jumped into coding questions

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

• Maintain a visited array to keep track of visited cells to avoid redundant traversal.

• Increment the island count each time a new island is encountered.

• Consider edge cases like boundary conditions and handling of diagonals while traversing.

• Handle the...read more
Answered by AI
Add your answer
Q2. 
Incremental Partitioning Problem Statement
Given two integers N and K, determine how many ways you can partition the number N into K non-empty groups such that the size of each group[i] >= group[i-1] f...read more
Ans. 
The problem involves determining the number of ways to partition a number into non-empty groups with specific constraints.
• Use dynamic programming to solve the problem efficiently.

• Consider the base cases and build up the solution using recurrence relation.

• Apply modular arithmetic to handle large numbers and prevent overflow.
Answered by AI
Add your answer