i
Expedia
Group
Filter interviews by
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 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 interviewSelectedI applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
What people are saying about Expedia Group
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
Medium level competitive programming question. Interviewer looked for the approach and working code.
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken to burn each node based on its distance from the starting node.
Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Round duration - 40 minutes
Round difficulty - Medium
Timing : Evening
Interviewer was frank. He checked for indepth knowledge of the subject.
Tip 1 : Leave a subject to prepare, but never leave a topic.
Tip 2 : Must go through previous years questions / interview experiences.
Tip 3 : Atleast 4 projects in CV
Tip 1 : At least 4 projects (working)
Tip 2 : Never put false things on resume.
I appeared for an interview in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
Round duration - 50 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.
E-commerce
I prioritize tasks, communicate effectively, and adapt my plans to manage interruptions while maintaining productivity.
Assess the interruption: Determine its urgency and importance. For example, if a team member needs immediate help, I prioritize that.
Reorganize my tasks: I create a new plan that accommodates the interruption while ensuring critical deadlines are met.
Communicate with stakeholders: I inform my team or m...
PreOrder traversal without recursion is done using a stack to simulate the function call stack.
Create an empty stack and push the root node onto it.
While the stack is not empty, pop a node from the stack and process it.
Push the right child of the popped node onto the stack if it exists.
Push the left child of the popped node onto the stack if it exists.
Yes
Create an empty binary search tree (BST)
Loop over the unsorted array
For each element, insert it into the BST using the appropriate insertion logic
Repeat until all elements are inserted
The resulting BST will be built from the unsorted array
The question asks to find two elements in an array whose sum is equal to a given number.
Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.
Use a hash set to store the elements as you iterate through the array for efficient lookup.
Return the pair of elements if found, otherwise return a message indicating no such pair exists.
There are two types of triggers: DML triggers and DDL triggers.
DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.
DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.
Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt...
Yes, triggers can be used with select statements in SQL.
Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.
While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.
Using triggers with select statements allows you to perform additional actions or validations before or af...
Indexing in MySQL improves query performance. There are several types of indexing in MySQL.
Indexes are used to quickly locate data without scanning the entire table.
Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.
B-tree indexes are the most common and suitable for most use cases.
Hash indexes are used for exact match lookups.
Full-text indexes are used for searching text-based data efficie...
Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.
MySQL supports multiple storage engines, each with its own strengths and features.
Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.
InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.
MyISAM is known for its simplicity and speed but lacks transaction suppo...
The Singleton pattern ensures a class has only one instance and provides a global point of access to it.
Restricts instantiation of a class to a single object.
Useful for managing shared resources, like database connections.
Implemented using private constructors and static methods.
Example in Java: public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if...
Yes, a constructor can be private.
A private constructor can only be accessed within the class itself.
It is often used in singleton design pattern to restrict object creation.
Private constructors are also useful for utility classes that only contain static methods.
based on 2 interview experiences
Difficulty level
Duration
based on 1 review
Rating in categories
Software Development Engineer II
248
salaries
| ₹22 L/yr - ₹36 L/yr |
Software Development Engineer 3
101
salaries
| ₹32.3 L/yr - ₹55.2 L/yr |
Software Development Engineer
82
salaries
| ₹18.9 L/yr - ₹32 L/yr |
Software Engineer
61
salaries
| ₹15.4 L/yr - ₹33.7 L/yr |
Data Scientist
60
salaries
| ₹29.2 L/yr - ₹51.2 L/yr |
Amazon
Flipkart
Udaan
BigBasket