i
Expedia Group
Filter interviews by
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].
Ds related questions
posted on 9 May 2024
45 MCQ Which includes below topics
Basic core Java
Database
Spring
Hibernate
Angular
One program based on core Java logic
Detect loop in a LinkedList
Use two pointers, one moving at twice the speed of the other
If there is a loop, the faster pointer will eventually catch up to the slower one
If there is no loop, the faster pointer will reach the end of the list
I applied via Recruitment Consulltant and was interviewed before Jun 2023. There were 2 interview rounds.
Autosuggest debounce is a feature that delays the search suggestions until the user stops typing, and a polyfill is a piece of code that provides functionality that is not natively supported by the browser.
Implement a debounce function to delay the autosuggest feature until the user stops typing.
Use a polyfill to provide support for the autosuggest feature in browsers that do not natively support it.
Example: Implement ...
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
Iterate through the array and keep track of the maximum sum ending at each index.
At each index, choose between extending the previous subarray or starting a new subarray.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
I applied via Approached by Company and was interviewed in Aug 2023. There were 3 interview rounds.
Interviewer asked two coding question medium level
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
I was asked 2 DSA questions. I answered them but the interviewer wasn't aware of the complexity of different Data structures so according to him my solution was taking n^3 complexity whereas it was actually the solution of n
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Development Engineer II
195
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer 3
75
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
62
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
54
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo