i
Expedia
Group
Filter interviews by
The diameter of a tree is the longest path between two leaf nodes in the tree.
Calculate the longest path between two leaf nodes in the tree
This can be done by finding the height of the left and right subtrees and adding them together
The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees
Design a hotel booking system for managing reservations and availability.
Use a database to store hotel information, room availability, and reservations.
Implement user authentication and authorization for booking.
Include a search feature for users to find available rooms based on their criteria.
Allow users to make reservations, modify or cancel them.
Send confirmation emails to users after successful bookings.
Find the longest subsequence in an array with sum zero.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap along with the index.
If the same sum is encountered again, the subsequence between the two indices has a sum of zero.
Design a parking lot system with features like parking, retrieving, and tracking available spots.
Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.
Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.
Use data structures like arrays or lists to manage parked vehicles and available spots.
Consider implementing fe...
What people are saying about Expedia Group
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].
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].
I applied via Company Website and was interviewed before Mar 2023. There were 4 interview rounds.
Solve sudoku, row and columns should have 1-9 numbers and the numbers shouldnt repeat
Design a parking lot system with features like parking, retrieving, and tracking available spots.
Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.
Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.
Use data structures like arrays or lists to manage parked vehicles and available spots.
Consider implementing feature...
I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.
Find the longest subsequence in an array with sum zero.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap along with the index.
If the same sum is encountered again, the subsequence between the two indices has a sum of zero.
The diameter of a tree is the longest path between two leaf nodes in the tree.
Calculate the longest path between two leaf nodes in the tree
This can be done by finding the height of the left and right subtrees and adding them together
The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees
Design a hotel booking system for managing reservations and availability.
Use a database to store hotel information, room availability, and reservations.
Implement user authentication and authorization for booking.
Include a search feature for users to find available rooms based on their criteria.
Allow users to make reservations, modify or cancel them.
Send confirmation emails to users after successful bookings.
Divide one big integer by another
I applied via Approached by Company and was interviewed before Nov 2022. There were 3 interview rounds.
Brush up on DS and Algorithms
I applied via Referral and was interviewed before Jan 2023. There were 3 interview rounds.
Rotate a matrix by 90 degrees.
Transpose the matrix
Reverse each row of the transposed matrix
The question asks for finding the longest substring in a given string that contains only unique characters.
Iterate through the string and keep track of the current substring
Use a set to check for duplicate characters
Update the longest substring if a longer one is found
Ecommerce hight level design
I applied via Approached by Company and was interviewed in Jan 2022. There were 4 interview rounds.
It was sort of pair programming where you will be told to implement some feature. Here they check your coding style, your approach and the architecture you follow.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I appeared for an interview in Oct 2024, where I was asked the following questions.
Levels of generation refer to the stages of software development, from requirements to deployment.
1st Generation: Machine code, directly executed by the CPU (e.g., binary code).
2nd Generation: Assembly language, using mnemonics (e.g., MOV, ADD).
3rd Generation: High-level languages (e.g., C, Java) that are more abstract and easier to read.
4th Generation: Languages focused on database querying and report generation (e.g....
based on 4 interview experiences
Difficulty level
Duration
based on 1 review
Rating in categories
Software Development Engineer II
249
salaries
| ₹22 L/yr - ₹38.5 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.7 L/yr |
Data Scientist
60
salaries
| ₹29.2 L/yr - ₹51.2 L/yr |
Amazon
Flipkart
Udaan
BigBasket