Swiggy Sdet Automation Test Engineer Interview Questions and Answers

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

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

Q1. Design URL shorterner
Ans. 
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.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer