i
Expedia
Group
Filter interviews by
I applied via Campus Placement
1.5 hours long, platform was hackerearth.
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.
I applied via Approached by Company and was interviewed before Jul 2023. There was 1 interview round.
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
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
Example: vec.push_back(10);
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was held during university hours and consisted of 2 coding questions.
Round duration - 120 minutes
Round difficulty - Easy
Make sure you do no cutting and are clear about the approach you'd be following.
Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.
Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.
Keep the number of elements in the two heaps balanced or differ by at most 1.
If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...
Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.
Application resume tips for other job seekersBe sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.
Final outcome of the interviewSelectedposted on 24 May 2017
I appeared for an interview in Aug 2016.
What people are saying about Expedia Group
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 24 Feb 2017
I appeared for an interview in Oct 2016.
posted on 30 Nov 2015
I applied via Campus Placement
I applied via Referral
Reverse a singly linked list in groups of k inplace
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
I appeared for an interview in Feb 2017.
I appeared for an interview in Oct 2016.
based on 2 interview experiences
Difficulty level
Duration
based on 3 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 |
Software Engineer
61
salaries
| ₹15.4 L/yr - ₹33.8 L/yr |
Data Scientist
60
salaries
| ₹29.2 L/yr - ₹51.2 L/yr |
Amazon
Flipkart
Udaan
BigBasket