i
Expedia Group
Filter interviews by
I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.
Moderate questions can be found on gfg
4 graph question and one DP
Top trending discussions
I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.
2 DSA questions and 70 minutes.
Min-stack is implemented using O(N) space by keeping track of minimum value at each element.
Use two stacks - one to store the actual elements and another to store the minimum value at each step.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is the current minimum.
Sliding Window Problem involves finding a subarray of fixed size k with the maximum sum.
Use a sliding window approach to iterate through the array and keep track of the sum of elements within the window.
Slide the window by removing the first element and adding the next element in each iteration.
Keep track of the maximum sum found so far and update it if a new maximum is found.
I applied via campus placement at Thapar Institute of Engineering and Technology (TIET) and was interviewed in Sep 2024. There was 1 interview round.
I was asked to do a string based hard level question. Interviewerr asked me how the code worked and the logic which i explained step by step.
2 hours mcqs from all cse related topics + 1 coding question
3 coding questions easy level
It was a 2 hour test having 2 coding questions . Difficulty was easy and medium.
Easy lc or medium lc quest
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
Duration: 1hr+
Topics: 2 - coding questions(logic-based)
platform: Hackerank
Find square root of a number using basic arithmetic operations without power operator and inbuilt libraries.
Use binary search to find the integer part of the square root
Use long division method to find the decimal part of the square root
Repeat the above steps until desired accuracy is achieved
Handle edge cases like negative numbers and numbers less than 1
Addition of two linked lists and return the result as a linked list.
Traverse both linked lists simultaneously
Add corresponding nodes and carry over the sum
Create a new linked list with the sum
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Don;t remember the leetcode question, was medium
Don't remember the leetcode qyuestion, was medium, had a behavior component, remember the Amazon principles
I applied via campus placement at Vellore Institute of Technology (VIT) and was interviewed in Jun 2022. There was 1 interview round.
Count occurrences of a given element in a sorted array.
Use binary search to find the first and last occurrence of the element.
Subtract the indices to get the count.
Handle edge cases like element not present in the array.
Find the deepest left node in a binary tree.
Traverse the tree recursively and keep track of the depth and whether the current node is a left node.
If the current node is a leaf node and its depth is greater than the deepest left node found so far, update the deepest left node.
Return the deepest left node found.
Example: For the binary tree with root node 1, left child 2, and left child of 2 being 4, the deepest left node...
I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed before Oct 2022. There were 4 interview rounds.
1 hour long test, 1 easy and 1 medium leetcode problem + some apti questions.
based on 1 review
Rating in categories
Software Development Engineer II
198
salaries
| ₹15.6 L/yr - ₹40 L/yr |
Software Development Engineer
93
salaries
| ₹12 L/yr - ₹34 L/yr |
Software Development Engineer 3
70
salaries
| ₹27 L/yr - ₹55 L/yr |
Software Developer
67
salaries
| ₹10 L/yr - ₹41.5 L/yr |
Software Engineer
58
salaries
| ₹12 L/yr - ₹37 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo