i
Expedia
Group
Filter interviews by
Create subarrays with sum = 0 from given array of integers.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.
If yes, then the subarray between those two indices has a sum of 0.
The question involves reversing nodes in groups of k and finding the sum of right leaf nodes.
Implement a function to reverse nodes in groups of k
Traverse the reversed linked list and find the sum of right leaf nodes
Handle edge cases like when the number of nodes is not a multiple of k
The question involves finding the sum of right leaf nodes and swapping nodes in groups of k.
The sum of right leaf nodes can be found by traversing the tree and checking if a node is a right leaf node.
Swapping nodes in groups of k can be done by iterating through the linked list and swapping the nodes in each group.
Examples: For the sum of right leaf nodes, consider a binary tree with nodes 1, 2, 3, 4, 5. The sum w...
The question involves finding the pivot in a rotated sorted array using combinatorics and count sort.
To find the pivot in a rotated sorted array, we can use a modified binary search algorithm.
First, we compare the middle element with the first element to determine if the pivot is in the left or right half.
Then, we continue dividing the array in half and adjusting the search range based on the pivot's location.
Coun...
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner and keep track of the first node at each level.
Use a queue to store nodes at each level and update the left view nodes accordingly.
Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Given an array of integers ARR
of size N
and an integer target
, find three integers in ARR
such that their sum is closest to the target
. If there are two closest sums, return ...
Find three integers in an array whose sum is closest to a given target, return the smallest sum if there are two closest sums.
Iterate through all possible triplets in the array to find the sum closest to the target.
Keep track of the closest sum found so far and update it if a closer sum is found.
Return the closest sum at the end of the iteration.
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the l...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in a linked list.
You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'
.
Your task is to implement a function that locates the speci...
Implement a function to delete a specific key from a Circular Linked List of integers.
Traverse the Circular Linked List to find the key to be deleted.
Adjust the pointers to remove the node containing the key.
Handle the case where the Circular Linked List becomes empty after deletion.
Return -1 if the Circular Linked List is empty after deletion.
In computing, a page fault occurs when a process accesses a memory page that is not currently mapped by the memory management unit. To handle new pages being br...
The problem involves determining the number of page faults using the Least Recently Used (LRU) replacement algorithm.
Page faults occur when a process accesses a memory page not currently mapped by the memory management unit.
Page replacement algorithm like LRU is used to decide which existing page should be replaced.
The goal is to calculate the number of page faults based on the given input sequences and memory cap...
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 t...
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
I want to join Expedia to contribute to innovative travel solutions and enhance user experiences in the dynamic travel industry.
Passion for Travel: I have a deep love for travel and believe in Expedia's mission to make travel accessible and enjoyable for everyone.
Innovative Technology: Expedia leverages cutting-edge technology to improve user experiences, and I am excited to contribute to such innovations.
Customer-Cent...
I applied via Campus Placement and was interviewed in Dec 2023. There were 2 interview rounds.
The first round was a 45 min long aptitude and case study round which involved basic aptitude questions along with certain cases like "There has been a drop off in customers booking a hotel though the the total number of visits to the site has not dropped. How would you you design a system to analyze the problem and what kind of data will you collect." It was followed by a couple of HR questions
A mock data set of hotel bookings in different countries for last two years were given a week prior to the interview. We were to clean, prepare, derive insights and recommend actions. All of this needed to be documented as 15 page presentation. This presentation then needed to be presented in a 45 min meet.
I applied via LinkedIn and was interviewed in Nov 2023. There were 2 interview rounds.
Create subarrays with sum = 0 from given array of integers.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.
If yes, then the subarray between those two indices has a sum of 0.
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner and keep track of the first node at each level.
Use a queue to store nodes at each level and update the left view nodes accordingly.
Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Leetcode easy and medium dsa problems.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
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.
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
The question involves finding the sum of right leaf nodes and swapping nodes in groups of k.
The sum of right leaf nodes can be found by traversing the tree and checking if a node is a right leaf node.
Swapping nodes in groups of k can be done by iterating through the linked list and swapping the nodes in each group.
Examples: For the sum of right leaf nodes, consider a binary tree with nodes 1, 2, 3, 4, 5. The sum would ...
posted on 12 Feb 2024
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
The question involves reversing nodes in groups of k and finding the sum of right leaf nodes.
Implement a function to reverse nodes in groups of k
Traverse the reversed linked list and find the sum of right leaf nodes
Handle edge cases like when the number of nodes is not a multiple of k
The question involves finding the pivot in a rotated sorted array using combinatorics and count sort.
To find the pivot in a rotated sorted array, we can use a modified binary search algorithm.
First, we compare the middle element with the first element to determine if the pivot is in the left or right half.
Then, we continue dividing the array in half and adjusting the search range based on the pivot's location.
Count sor...
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
Perosnality tets related questions in aptitude test
Questions on product management, mcqs and video round
I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.
Moderate questions can be found on gfg
4 graph question and one DP
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Dynamic Programming and arrays
Top trending discussions
The duration of Expedia Group interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 10 interview experiences
Difficulty level
Duration
based on 329 reviews
Rating in categories
Gurgaon / Gurugram,
Bangalore / Bengaluru
12-17 Yrs
Not Disclosed
Software Development Engineer II
246
salaries
| ₹22 L/yr - ₹38.6 L/yr |
Software Development Engineer 3
101
salaries
| ₹32 L/yr - ₹55.2 L/yr |
Software Development Engineer
82
salaries
| ₹12 L/yr - ₹40 L/yr |
Software Engineer
61
salaries
| ₹12 L/yr - ₹35.8 L/yr |
Data Scientist
60
salaries
| ₹29.2 L/yr - ₹51.2 L/yr |
Amazon
Flipkart
Udaan
BigBasket