i
Expedia Group
Filter interviews by
I applied via LinkedIn and was interviewed in Jan 2024. There were 3 interview rounds.
Easy Interview basic questions
3 hour test. 20 MCQs and 2 Coding problems
Prefix Sum and left sum of binary tree involves calculating the sum of all nodes in a binary tree and the sum of nodes on the left side of each node.
Calculate prefix sum of binary tree by traversing in a pre-order manner and keeping track of the running sum.
To calculate left sum of binary tree, traverse the tree in a pre-order manner and keep track of the sum of nodes on the left side of each node.
Example: For a binary...
Recursion to memoization DP problem involves optimizing recursive solutions by storing intermediate results.
Recursion involves solving a problem by breaking it down into smaller subproblems and calling the function recursively.
Memoization involves storing the results of expensive function calls and reusing them when the same inputs occur again.
Dynamic Programming (DP) involves solving problems by breaking them down int...
I applied via Job Portal and was interviewed in Feb 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
It was very good 60 questions
3 coding question everhthing was hard
Java is a popular programming language, C++ is another programming language, and DBMS SQL is a language used for managing databases.
Java is an object-oriented programming language commonly used for building web applications and software.
C++ is a high-level programming language often used for system programming and game development.
DBMS SQL is a language used to interact with relational databases, allowing users to retr...
Python is a high-level programming language known for its simplicity and readability. OOPs (Object-Oriented Programming) is a programming paradigm that uses objects and classes. Inheritance is a feature of OOPs that allows a class to inherit properties and behavior from another class.
Python is a versatile, interpreted language used for web development, data analysis, artificial intelligence, and more.
OOPs focuses on cr...
Design a URL shortener service to generate short URLs for long URLs.
Use a hashing algorithm to generate unique short codes for long URLs.
Store the mapping of short codes to long URLs in a database.
Redirect users from short URLs to the corresponding long URLs.
Implement analytics to track usage and performance of the service.
posted on 8 Jul 2024
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
First was round based on Quality engineering concepts and aptitude combob
Test scenario is a high-level description of the functionality to be tested, while test case is a detailed step-by-step procedure to validate the functionality.
Test scenario is a broad description of what needs to be tested, while test case is a detailed set of steps to verify a specific aspect of the scenario.
Test scenario is usually written in a more general and abstract way, while test case is more specific and conc...
posted on 16 Feb 2024
I applied via LinkedIn and was interviewed in Jan 2024. There were 2 interview rounds.
It consisted of 2 dsa questions
I am an experienced SDET Automation Test Engineer with a strong background in software testing and test automation.
I have a Bachelor's degree in Computer Science and have been working in the field for over 5 years.
I have expertise in designing and implementing test automation frameworks using tools like Selenium and Cucumber.
I have experience in writing test scripts, executing test cases, and analyzing test results.
I a...
I applied via Recruitment Consulltant and was interviewed in May 2024. There were 3 interview rounds.
I applied via Referral and was interviewed in Aug 2024. There was 1 interview round.
Arrays Strings Hashmaps were asked
I appeared for an interview before Sep 2020.
Round duration - 120 minutes
Round difficulty - Medium
10 min for debugging
40 min for problems(coding)
40 min for pyschometric
30 min for aptitude
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The task is to calculate the total number of unique paths from the top-left to bottom-right corner of an M x N matrix by moving only right or down.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the number of unique paths for each cell in the matrix.
Initialize the first row and first column with 1 as there is only one way to reach each cell in the first row and column.
For each cell ...
You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...
Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.
Split strings 'A' and 'B' into words
Count frequency of each word in 'A'
Check if word is not in 'B' and is the most frequent and lexicographically smallest
Return the word or -1 if no such word exists
Round duration - 90 Minutes
Round difficulty - Easy
timing was 4 pm . we connected on amazon chime. Initially he asked me a few things from resume then moved on to problem solving.
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
You are given an array/list HEIGHTS
of length N
, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
Find the area of the largest rectangle that can be formed within the bounds of a given histogram.
Iterate through the histogram bars and maintain a stack to keep track of increasing heights.
Calculate the area of the rectangle formed by each bar as the smallest height in the stack times the width.
Update the maximum area found so far and return it as the result.
Tip 1 : be confident since interviewer is looking at how confident you are with your skills
Tip 2 : dont learn the algorithms but try to understand them
Tip 3 : focus on trees and graphs since amazon asks more of that
Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Development Engineer II
206
salaries
| ₹15.6 L/yr - ₹40 L/yr |
Software Development Engineer
95
salaries
| ₹12 L/yr - ₹36 L/yr |
Software Development Engineer 3
77
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