Expedia Group Sdet Automation Test Engineer Interview Questions and Answers

The round was good and nice

The round was good and nice

Very Easy questions just do it

Q1. What is your introduction
Add your answer
Q2. Why SDE 1 only not SDE 2
Ans. 
SDE 1 is an entry-level position where candidates gain foundational skills before advancing to SDE 2.
• SDE 1 focuses on learning and building foundational skills in software development.

• SDE 2 requires more experience and expertise in software development.

• Advancing from SDE 1 to SDE 2 is a common career progression in tech companies.

• SDE 1 roles often involve working on smaller projects or components of larger projects.

• SDE...read more
Answered by AI
Add your answer
Q3. If bully happens will you bully someone
Ans. 
No, I believe in standing up against bullying and supporting those who are being bullied.
• I do not support bullying in any form and believe in treating others with respect and kindness.

• I would try to intervene and help the person being bullied, either by talking to the bully or seeking help from a teacher or supervisor.

• I believe in creating a positive and inclusive environment where everyone feels safe and respected.
Answered by AI
Add your answer
Q4. If taken leave can you work 7 days a week
Add your answer

Q1. Data structure related question
Add your answer

Q1. Nodejs related questions
Add your answer
Q2. Promises Async Await Events emitter
Ans. 
Promises, async/await, and event emitters are all ways to handle asynchronous operations in JavaScript.
• Promises provide a way to handle asynchronous operations by returning a promise object that can be resolved or rejected.

• Async/await is a syntax for working with promises that makes code easier to read and write.

• Event emitters allow you to create custom events that can be triggered and listened for in your code.
Answered by AI
Add your answer

Q1. System design related question
Add your answer
Q2. Design a system like facebook
Ans. 
Design a system like Facebook
• Create a user registration and login system

• Implement a news feed for users to see updates from friends

• Allow users to create and join groups

• Include features like messaging, commenting, and liking posts

• Implement privacy settings for users to control who can see their content
Answered by AI
Add your answer

Q1. System design and behavioral
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The first round was a coding round. 2 DSA based questions were asked.

Q1. 
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time Start[i] and end time End[i], you need to determine which meetings can be organized in a single meeting room such ...read more
Ans. 
Greedy approach can be applied to solve this problem. We sort the start and end time pairs for each meeting on the basis of the end time. Then we compare if the next meeting's start time is greater than the previous meeting's end time. If the start time is greater, we can count this meeting and we increase our meeting counter otherwise this meeting can't take place. In this manner, we traverse through all the meeting p...read more
Answered Anonymously
Add your answer
Q2. 
Peak Element Finder
For a given array of integers arr, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, if arr[i] is the peak, then both...read more
Ans. 
The brute force solution would be to do a linear search and find the element. 
Time Complexity : O(n) 

The brute force solution can be optimized using Binary Search. The idea is to find the bitonic point k which is the index of the maximum element of a given sequence. If the element to be searched is greater than the maximum element return -1, else search the element in both halves. 
Steps : 
1. Find th...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

The second round was a system design round.

Round duration - 30 minutes
Round difficulty - Easy

This was a typical managerial round.

3 hour test. 20 MCQs and 2 Coding problems

Q1. Prefix Sum and left sum of binary tree.
Ans. 
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...read more
Answered by AI
Add your answer

Q1. Recursion to memoization DP problem and follow ups.
Ans. 
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...read more
Answered by AI
Add your answer

Basic DSA, Sorting question , SQl Query , Stack,queue, linked list, etc