i
Expedia
Group
Filter interviews by
More than the right answer, focus on the approach. Duration 60 min.
A cloud storage service like Google Drive for storing and sharing files
Allow users to upload, store, and organize files in folders
Provide sharing options for files and folders with permissions
Include collaboration features like real-time editing and commenting
Offer integration with other services like Google Docs, Sheets, and Slides
I want to join Expedia because of its innovative technology, global impact, and collaborative work culture.
Expedia is known for its cutting-edge technology and innovative solutions.
I am excited about the opportunity to work on projects with a global impact.
I value a collaborative work culture where I can learn from and contribute to a talented team.
Expedia's reputation for work-life balance and employee development is ...
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 30 Nov 2015
I applied via Campus Placement
I applied via Referral
Reverse a singly linked list in groups of k inĀplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
What people are saying about Expedia Group
I appeared for an interview in Oct 2016.
I appeared for an interview before Sep 2016.
Search an element in sorted rotated array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle the cases where the target element is at the pivot point or not present in the array.
Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.
Use dynamic programming to solve the problem
Create a 2D array to store the number of paths
Traverse the matrix and update the array based on the allowed paths
Return the value at the last index of the array
I appeared for an interview in Aug 2017.
based on 1 interview experience
based on 4 reviews
Rating in categories
Software Development Engineer II
246
salaries
| ā¹22 L/yr - ā¹36 L/yr |
Software Development Engineer 3
104
salaries
| ā¹31.9 L/yr - ā¹53.6 L/yr |
Software Development Engineer
76
salaries
| ā¹18.6 L/yr - ā¹33.8 L/yr |
Senior Software Engineer
62
salaries
| ā¹36.2 L/yr - ā¹64 L/yr |
Software Engineer
61
salaries
| ā¹15.4 L/yr - ā¹33.8 L/yr |
Amazon
Flipkart
Udaan
BigBasket