AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Shopclues QA Engineer Interview Questions and Answers
Shopclues QA Engineer Interview Experiences
1 interview found
Anonymous
Selected
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
(2 Questions)
- Q1. Sdlc what is process
- Ans.
SDLC (Software Development Life Cycle) is a process used by software development teams to design, develop, test, and deploy software.
SDLC involves planning, designing, coding, testing, and deployment stages.
It ensures that software is developed efficiently and meets the requirements of stakeholders.
Common SDLC models include Waterfall, Agile, and DevOps.
Each stage of SDLC has specific goals and deliverables.
SDLC helps ...
- Q2. Stlc what is proces
- Ans.
STLC (Software Testing Life Cycle) is a process followed by QA Engineers to ensure high quality software.
STLC involves planning, designing, executing, and reporting on tests.
It includes phases like requirement analysis, test planning, test design, test execution, and test closure.
Each phase has specific activities and deliverables to ensure thorough testing of the software.
Example: In requirement analysis, QA Engineers...
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Selected
I applied via Job Fair and was interviewed before Apr 2023. There was 1 interview round.
Basic QA question. Tope 50 qa question
Kumar Mayank
Binary Search questions were asked
Peak in a mountain array question were asked
(2 Questions)
- Q1. Salary Questions were asked
- Q2. Salaryyy questions were asked
Interview Preparation Tips
Interview Preparation Tips
Experience: GD was conducted for shortlisted candidates and candidates were divided into groups of 6 people.There were 3 topics and each topic was discussed for 2 minutes.No specific rules,like each person needs to speak,are to be followed during the GD.Anyone can initiate,intervene,etc. Finally we were asked to link all three topics and this discussion went on for another 2 minutes.
Round: HR Interview
Experience: Only a single round lasting about 40-45 minutes.There were only 4 people in the panel and technical as well as HR questions were asked. First I was asked to go through my own resume, “Introduce/Tell us about yourself?". E.g.:“Where have you shown leadership qualities?Have you led a
team?Size of team? What new initiatives did you take?”.Core questions starting form basics like “How does an airplane fly?” to specific questions about the different types of engines used in airplanes,their specifications, etc. were asked. HR questions were put up like"What was the most difficult decision in your life?" and grilled on my internship for 15-20 minutes which I did in Transocean. (Another oil field services company).
General Tips: You need to be very good in the basics of your
core courses and if you have done an internship in the oil industry,
you will definitely be grilled on that.Questions will be asked in quick succession.
Skill Tips: Highlight any intern in Oil industry or anything related to that in your resume.Any POR or any sport activity which shows your leadership qualities should me mentioned in your resume.
Skills: Leadership qualities, Athletic, Quick thinking, presence of mind
College Name: IIT MADRAS
Aman Jain
Interview Preparation Tips
Experience: Algorithmic coding test was conducted on hackerank platform. Around 60 students gave online test. There were 4-5 algo questions to be done in 90 mins duration.
Tips: Try to do at least 2 questions.
Round: Technical Interview
Experience: First Interviewer asked me to introduce myself. Then he asked me questions on data structures & Algo. He asked me about tree data structures, why it is used, time complexities of various operations on tree, balancing of tree, AVL Tree. He asked me write AVL Tree insertion, deletion, update code. Then he jumps to BTree, B+Tree and asks me write code on paper for various operations. Questions were asked on indexing, various types of indexing, how it is used in databases, etc. Then he briefly asked about the project I done in my internship.
Round: Technical Interview
Experience: Interviewer asked me how was my 1st round, I said it was great. He first asked me introduce myself. Then he asked about my projects mentioned in my resume. I done a project in machine learning on spam webpage detection. He was interested in that. He asked me what language, libraries I used to implement that project. Then he gave me real time scenario to predict whether an item is explosive or not. Then I approached this problem and asked information related to problem. He was impressed by the approach I target the problem. He asked me what machine learning model will be best and what are their pros and cons. Then he asked me question that given 100 sorted linked lists, you have to merge them and return single sorted linked list. I gave 3-4 solutions with their time & space complexities.
Round: HR Interview
Experience: Interviewer asked me common HR questions like tell me about yourself, my family background, why do you want to join the company, what impact you can make in Snapdeal, why should we hire you. After that he congratulated me for the role of SDE at Snapdeal. I was very happy at that moment.
All the 5 students cleared this round.
Skills: SQL, ML, Algorithms And Data Structures, Python, Basic C/C++
College Name: IIT Guwahati
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
- Q1.
Balanced Parentheses Check
Given a string
STRconsisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.Input:
The first line contains an inte... - Ans.
Implement a function to check if parentheses in a string are balanced.
Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parenthes...
- Q2.
Find the Next Greater Number with the Same Set of Digits
Given a string
Sthat represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ... - Ans.
The task is to find the smallest number greater than the given number with the same set of digits.
Sort the digits of the number in descending order.
Find the first digit from the right that is smaller than the digit to its right.
Swap this digit with the smallest digit to its right that is greater than it.
Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
- Q1.
Maximum Level Sum in Binary Tree Problem Statement
Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any le...
- Ans.
Find the maximum sum for any level in a binary tree.
Traverse the binary tree level by level and calculate the sum for each level.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Example: For the input tree, the maximum level sum is 13 (5+6+2).
- Q2.
Find Top K Frequent Numbers in a Stream
Given an integer array
ARRand an integerK, your task is to find theKmost frequent elements inARR. Return the elements sorted in ascending order.Example:
Inp...
- Ans.
Find the K most frequent elements in an integer array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
- Q1.
Vertical Sum in a Binary Tree
Given a binary tree where each node has a positive integer value, compute the vertical sum of the nodes. The vertical sum is defined as the sum of all nodes aligned along the...
- Ans.
Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.
Traverse the binary tree in a level order manner to calculate the vertical sum.
Use a hashmap to store the vertical sum at each vertical level.
Recursively traverse the tree and update the vertical sum in the hashmap.
Output the vertical sums in the required format for each test case.
- Q2. What is TCP/IP?
- Ans.
TCP/IP is a set of protocols that governs the way data is transmitted over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to connect devices on the internet.
TCP ensures that data is reliably transmitted between devices.
IP is responsible for addressing and routing data packets across networks.
Examples of TCP/IP protocols include HTTP, FTP, and
Round duration - 30 minutes
Round difficulty - Easy
Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Aditya Sundaram
Interview Preparation Tips
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.
Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.
General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal
Interview Questionnaire
9 Questions
- Q1. Calculate the level sum of the binary tree
- Ans.
Calculate the level sum of a binary tree.
Traverse the tree level by level using BFS
Add the values of nodes at each level
Store the level sum in an array
Return the array of level sums
- Q2. Defective ball puzzle problem
- Q3. Some basic problems (OOP concept,basic datastructures)
- Q4. Vertical sum of binary tree
- Ans.
Vertical sum of binary tree is the sum of all nodes in each vertical line of the tree.
Traverse the tree in-order and keep track of the horizontal distance of each node from the root.
Use a hash table to store the sum of nodes at each horizontal distance.
Recursively traverse the left and right subtrees and update the hash table accordingly.
- Q5. Questions on TCP/IP, Database, OS, Data-structures, (and on many more which you studied in your whole college life)
- Q6. Calculate the top 10 words , which comes frequently in 1 hour time span , on facebook, (dynamically)
- Ans.
Calculate top 10 frequently used words on Facebook in 1 hour dynamically.
Use Facebook API to fetch data
Implement a script to count word frequency
Sort the words based on frequency and return top 10
- Q7. Tell About Yourself
- Ans.
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Proficient in programming languages such as Java, Python, and JavaScript
Experience with front-end frameworks like React and Angular
Familiarity with back-end technologies such as Node.js and Spring Boot
Strong understanding of data structures and algorithms
Ability to work collaboratively in a team environment
- Q8. Family Background
- Q9. Number of rectangles/squares in chess board
- Ans.
There are 204 squares and 1296 rectangles on a standard 8x8 chess board.
The number of squares can be calculated using the formula n(n+1)(2n+1)/6, where n is the number of rows/columns.
The number of rectangles can be calculated using the formula n(n+1)m(m+1)/4, where n and m are the number of rows and columns respectively.
For an 8x8 chess board, there are 64 squares of size 1x1, 49 squares of size 2x2, 36 squares of siz...
Interview Preparation Tips
Experience: There were 22 MCQ questions on the technical .while 3 questions were of coding type .1.check for balanced parentheses in an expression2. Find out next higher number with same set of digits3. Doesn't Remember.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
Duration: 90 minutes
Total Questions: 25
Round: Technical Interview
Experience: My experience was very awesome , i answered all the questions , although in starting i was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
Tips: Don't get panic. Just listen the questions carefully and then answer it.
Round: Technical Interview
Experience: I was not confident while answering Q3, and my answer was not appropriate, though after with little help of interviewer i got the answer properly.
Round: HR Interview
Tips: Keep confidence and show them good communication skills.Previous round's performance also matters in this rounds
College Name: NIT JALANDHAR
Funny Moments: In H.R. RoundOne of my friend was interviewed before me, so he told me the questions,H.R. asked him, and one of them was, number of squares in chess board, and then there was my turn for H.R. interview, i went, and he asked me , In chess board , there are how many , before completing his question i answered,204, while his question was , how many rectangles, "ye question pakka tune apne friend se pucha hoga :p " then we passed smiles, but i gave him proper solution of calculation of 204, and then answered my question too.
Skills evaluated in this interview
I applied via Referral and was interviewed before May 2021. There was 1 interview round.
(2 Questions)
- Q1. It is relevant to area where you are expertises and for position you applied for
- Q2. Relevant to position
Interview Preparation Tips
I applied via Referral
Interview Questionnaire
13 Questions
- Q1. I was asked to derive the time complexity of my code from the written test. It was to print the elements of a binary tree in spiral order
- Q2. Program to swap two pointers
- Ans.
A program to swap two pointers.
Declare two pointers of the same data type
Assign the first pointer to a temporary variable
Assign the second pointer to the first pointer
Assign the temporary variable to the second pointer
- Q3. Program to determine whether a given binary tree is binary search tree. I was asked to solve this in two different ways
- Q4. Two DBMS queries involving aggregate functions
- Q5. Program to implement Dijkstra’s algorithm
- Ans.
Dijkstra's algorithm finds shortest path between nodes in a graph
Create a graph with nodes and edges
Initialize distances from source node to all other nodes as infinity
Set distance from source node to itself as 0
Create a set of unvisited nodes
While unvisited set is not empty, select node with minimum distance
For each neighbor of selected node, calculate distance from source node
If calculated distance is less than curre...
- Q6. Program to implement FloydWarshall’s agorithm
- Ans.
Floyd-Warshall's algorithm is used to find the shortest path between all pairs of vertices in a weighted graph.
Create a 2D array to store the distances between all pairs of vertices.
Initialize the array with the weights of the edges in the graph.
Use nested loops to iterate over all pairs of vertices and update the distances if a shorter path is found through a third vertex.
The final array will contain the shortest dist
- Q7. Program to print the elements of a matrix in spiral order recursively
- Ans.
Program to print matrix elements in spiral order recursively
Create a recursive function to print the elements in spiral order
Define the boundaries of the matrix and traverse the matrix in spiral order
Call the recursive function to print the elements in spiral order
Handle edge cases such as empty matrix or matrix with only one row/column
- Q8. Given an unsorted array of numbers, find two numbers which add up to the given sum in O(n)
- Ans.
Find two numbers in an unsorted array that add up to a given sum in O(n)
Use a hash table to store the difference between the sum and each element in the array
Iterate through the array and check if the current element is in the hash table
If it is, return the current element and the corresponding difference
If not, add the current element to the hash table
- Q9. Explain indexing in DBMS
- Ans.
Indexing is a technique used in DBMS to improve the performance of queries.
Indexing creates a separate data structure that allows faster retrieval of data.
It works by creating a pointer to the location of data in the table.
Indexes can be created on one or more columns of a table.
Types of indexing include B-tree, hash, and bitmap indexing.
Indexes can also be clustered or non-clustered.
Clustered indexes determine the phy...
- Q10. Explain B and B+ trees
- Ans.
B and B+ trees are data structures used for efficient searching and sorting of large datasets.
B trees are balanced trees used for disk-based storage systems.
B+ trees are similar to B trees but have all data stored in the leaf nodes for faster searching.
B trees have a variable number of keys per node, while B+ trees have a fixed number.
B trees have a higher fanout than B+ trees, making them more efficient for smaller da...
- Q11. Given a binary tree, write a program to determine whether there exists a root to leaf path having the given sum
- Q12. Program to find the lowest common ancestor of two nodes in binary search tree as well as binary tree. I was also asked to give the brute force approach for the same
- Ans.
Program to find lowest common ancestor of two nodes in binary search tree and binary tree with brute force approach.
For binary search tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.
For binary tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.
Brute force approach involves checking each node's descendants to see if they contain both nodes.
...
- Q13. Program to print all ancestors of a node in a binary tree
- Ans.
Program to print all ancestors of a node in a binary tree
Create a recursive function to traverse the binary tree
Check if the current node is the target node
If yes, print all the nodes in the call stack
If not, recursively call the function for left and right subtrees
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Shopclues Interview FAQs
Tell us how to improve this page.
Shopclues Interviews By Designations
- Shopclues Senior Analyst Interview Questions
- Shopclues Software Developer Interview Questions
- Shopclues Intern Interview Questions
- Shopclues Software Development Engineer Intern Interview Questions
- Shopclues QA Engineer Interview Questions
- Shopclues SDE Interview Questions
- Shopclues Team Lead Interview Questions
Interview Questions for Popular Designations
- Senior QA Engineer Interview Questions
- Software QA Engineer Interview Questions
- Test Engineer Interview Questions
- QA Test Engineer Interview Questions
- Automation Test Engineer Interview Questions
- Senior Test Engineer Interview Questions
- QA Automation Engineer Interview Questions
- QA Trainee Interview Questions
- Show more
Shopclues QA Engineer Interview Process
based on 1 interview
Interview experience
QA Engineer Interview Questions from Similar Companies
Fast track your campus placements
Shopclues QA Engineer Reviews and Ratings
based on 2 reviews
Rating in categories
|
Software Engineer
50
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Analyst
44
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Analyst
36
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Category Account Manager
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Flipkart
Snapdeal
Paytm Mall
- Home >
- Interviews >
- Shopclues Interview Questions >
- Shopclues QA Engineer Interview Questions
