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

First was round based on Quality engineering concepts and aptitude combob

Q1. Question on How proxy configured for device
Add your answer
Q2. What is test scenario,test case.
Ans. 
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...read more
Answered by AI
Add your answer

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

It was very good 60 questions

3 coding question everhthing was hard

Q1. What is java and cpp and dbms sql etc
Ans. 
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...read more
Answered by AI
Add your answer
Q2. What is python, oops and inheritance
Ans. 
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...read more
Answered by AI
Add your answer

It consisted of 2 dsa questions

Q1. Tell me abiut yourself
Ans. 
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...read more
Answered by AI
Add your answer
Q2. Your weaknesses
Add your answer

Q1. Find string in array
Ans. 
Search for a specific string in an array of strings.
• Iterate through the array and compare each string with the target string.

• Use a loop to go through each element in the array and check for a match.

• Consider using built-in methods like indexOf() or includes() for efficient searching.

• Handle cases where the target string is not found in the array.
Answered by AI
Add your answer
Q2. Find string in array
Ans. 
Search for a specific string in an array of strings.
• Iterate through the array and compare each string with the target string.

• Use a loop to go through each element in the array and check for a match.

• Consider using built-in methods like indexOf or includes for efficient searching.
Answered by AI
Add your answer
Q3. Subarray in given array
Ans. 
Find all subarrays in a given array of strings
• Iterate through the array and consider each element as the starting point of a subarray

• For each starting point, iterate through the array to find all possible subarrays

• Store each subarray found in a separate list
Answered by AI
Add your answer
Q4. Stack for balance paranthesis
Ans. 
Use stack data structure to check for balanced parentheses in a string.
• Create an empty stack to store opening parentheses

• Iterate through the string and push opening parentheses onto the stack

• When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis

• If stack is empty at the end and all parentheses have been matched, the string is balanced
Answered by AI
Add your answer
Q5. Mean heap fo minimising the cost
Ans. 
A mean heap is a data structure that minimizes the cost of accessing the smallest element.
• Mean heap is a type of binary heap where the value of each node is less than or equal to the values of its children.

• It is useful for finding the minimum element quickly, as the root node always contains the smallest value.

• Insertion and deletion operations in a mean heap have a time complexity of O(log n).
Answered by AI
Add your answer