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].
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
1 hr
Coding qn on dynamic programing
Related to Dp and other questions is related to array like reverse and find duplicate in an array, String matching Questions
Guestimate were asked like how many syringes are used in a city
Half an hour Java boilerplate question
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I applied via Referral and was interviewed in Aug 2024. There was 1 interview round.
Design a Splitwise application for managing shared expenses among friends.
Implement user authentication and authorization for secure access.
Create a user-friendly interface for adding expenses and splitting them among friends.
Develop algorithms for calculating balances and settling debts between users.
Include features for adding comments, attaching receipts, and generating reports.
Consider scalability and performance o...
I applied via Approached by Company and was interviewed in Sep 2023. There were 3 interview rounds.
Replace zeros surrounded by ones with ones in an array of strings
Iterate through each string in the array
Check for zeros surrounded by ones and replace them with ones
Return the modified array of strings
The minimum number of jumps needed to reach the end of an array.
Use dynamic programming to keep track of the minimum jumps needed at each index.
At each index, calculate the maximum reachable index and update the minimum jumps accordingly.
Example: For array [2, 3, 1, 1, 2, 4, 2, 0, 1, 1], the minimum jumps needed is 4.
Design classes for a bidding system with new bid notifications for users who have already bid.
Create a Bid class with attributes like bidder, amount, timestamp, etc.
Create a Notification class with attributes like message, recipient, timestamp, etc.
Create a BiddingSystem class to manage bids and notifications.
Implement a method in BiddingSystem to notify users who have already bid when a new bid is placed.
Consider usin...
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
Basic coding test from hackerearth.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Development Engineer II
221
salaries
| ₹15.6 L/yr - ₹40 L/yr |
Software Development Engineer
95
salaries
| ₹12 L/yr - ₹36 L/yr |
Software Development Engineer 3
78
salaries
| ₹27 L/yr - ₹58 L/yr |
Software Engineer
60
salaries
| ₹12 L/yr - ₹36 L/yr |
Software Developer
51
salaries
| ₹10 L/yr - ₹35 L/yr |
Amazon
Flipkart
Udaan
BigBasket