Expedia Group Software Developer Intern Interview Questions, Process, and Tips for Freshers

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

Round duration - 90 Minutes
Round difficulty - Medium

The interview round was scheduled in the afternoon. It was of 1 hour 30 minutes.

Q1. 
Encode the Message Problem Statement
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...read more
Ans. 
Implement a function to encode a text message using run-length encoding.
• Iterate through the message and count consecutive characters

• Append the character and its count to the encoded message

• Handle edge cases like single characters or empty strings
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 when N = 0 or K = 0.

• Keep track of the number of ways to partition N into K groups satisfying the given conditions.

• Apply modulo 1e9 + 7 to the final result.

• Example: For input 5 3, the output is 2 as there are 2 ways to p
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

An introduction along with a coding question based on Data Structures and algorithms. The online interview round was held in afternoon time and the interviewer was quite good.

Q1. 
Find the Winner Problem Statement
Given an array/list VOTES containing names of candidates, where each entry represents the vote received by the candidate.
You need to determine the candidate with the ma...read more
Ans. 
Given an array of candidate names and their votes, find the candidate with the maximum votes, with tiebreaker based on lexicographical order.
• Iterate through the array of candidate names and keep track of the count of each candidate's votes.

• Find the candidate with the maximum votes. If there is a tie, return the lexicographically smaller name.

• Handle multiple test cases by repeating the process for each test case.

• Output ...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

An introduction along with a coding question based on Dynamic Programming and arrays. The online interview round was held in afternoon time and the interviewer was quite good.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. 
Find the third largest element in an array of distinct integers.
• Sort the array in descending order and return the element at index 2.

• Alternatively, keep track of the three largest elements while iterating through the array.

• Handle cases where there are less than 3 elements in the array.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

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

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement thoroughly to identify the expected behavior of the code.

• Review the code line by line to identify any syntax errors, logical errors, or potential bugs.

• Use debugging tools like breakpoints, print statements, or IDE debuggers to trace the flow of code execution.

• Test...read more
Answered by AI
Add your answer

Round duration - 40 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. 
Count Substrings with Only Vowels
In this task, you need to find the number of substrings within a given string ’S’ that consist only of vowels.
Explanation:
A substring is defined as a contiguous seque...read more
Ans. 
Count the number of substrings consisting of only vowels in a given string.
• Iterate through all substrings of the input string.

• Check if each substring consists only of vowels.

• Increment a counter for each valid substring found.

• Return the final count as the output.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

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

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

Q1. 
Ninja's Lootcase Problem Statement
Ninja stumbled upon a locked suitcase while digging in his lawn. The only way to unlock it is by following specific instructions stated on an accompanying paper.
Explan...read more
Ans. 
The problem involves transforming an array into specific elements using given operations. Find the minimum number of steps required.
• Iterate through the array and calculate the number of steps needed to transform each element into the desired value

• For each element, calculate the difference between the current value and the desired value, then determine the minimum number of steps required to reach that value

• Keep track o...read more
Answered by AI
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Implement binary search to find the target integer in the rotated array.

• Handle the rotation while performing binary search.

• Return the index of the target integer if found, else return -1.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in non-decreasing order.
• Use a hashmap to store the difference between the target sum and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Sort the pairs based on the first element and then the second element.

• Return the list of pairs that satisfy the sum condition.
Answered by AI
Add your answer
Q2. 
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 finding 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.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th and (N-2)th stairs.

• Handle base cases for 0 and 1 stairs separately.

• Apply modulo operation to avoid overflow while calculating the result.

• Consider using memoizati...read more
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me in between for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Round duration - 90 minutes
Round difficulty - Medium

Round comprised of 6 MCQ's along with 2 Coding questions, paper was not that difficult but it felt quite lengthy.

Q1. 
Minimum Distinct Labels Problem Statement
You are given N boxes on a table, each with an integer label. The labels of these boxes are provided in an array ARR. Your task is to remove exactly M boxes such ...read more
Ans. 
Given N boxes with integer labels, remove M boxes to minimize distinct labels left.
• Iterate through the array and count the frequency of each label

• Sort the frequencies in descending order

• Remove M boxes with the highest frequencies to minimize distinct labels
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 it.
Answered by AI
Add your answer