i
Flipkart
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Company Website and was interviewed in Apr 2023. There was 1 interview round.
There are two types of damages: visible and concealed. Returns are validated through inspection and testing.
Visible damages are those that can be seen with the naked eye, such as scratches or dents.
Concealed damages are those that are not immediately visible, such as internal damage or defects.
Returns are validated through inspection and testing to determine the extent of the damage and whether it was caused by the cus...
I have conducted internal, external, and supplier audits. Accuracy depends on the scope and objectives of the audit.
I have conducted internal audits to assess the effectiveness of the company's quality management system.
I have conducted external audits to evaluate the compliance of suppliers with the company's quality standards.
I have conducted supplier audits to ensure that the company's suppliers meet the required qu...
posted on 15 Jun 2024
I applied via Naukri.com and was interviewed before Jun 2023. There were 4 interview rounds.
Test the Application.
Basic aptitude questions.
posted on 7 Apr 2025
I appeared for an interview in Mar 2025, where I was asked the following questions.
SDLC stands for Software Development Life Cycle, a structured process for developing software applications.
Phases include: Planning, Analysis, Design, Implementation, Testing, Deployment, and Maintenance.
Example: In the Planning phase, project goals and scope are defined.
In the Testing phase, software is rigorously tested for bugs and performance issues.
Agile and Waterfall are popular SDLC models, each with distinct ap
Smoke testing is a preliminary test to check the basic functionality of a software build before further testing.
Smoke testing is often referred to as 'build verification testing'.
It checks critical functionalities to ensure the build is stable.
Example: After a new build, testers verify if the application launches and basic features work.
It is usually automated to save time and resources.
Smoke tests are not exhaustive;
I applied via Recruitment Consulltant and was interviewed before Aug 2021. There were 2 interview rounds.
I applied via Job Portal and was interviewed before Oct 2020. There were 4 interview rounds.
posted on 22 Mar 2021
I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.
I applied via Referral
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Company Website and was interviewed in Oct 2020. There was 1 interview round.
I applied via Campus Placement
Some of the top questions asked at the Flipkart Executive Quality Assurance interview for experienced candidates -
based on 1 interview
Interview experience
based on 14 reviews
Rating in categories
Senior Executive
2.8k
salaries
| ₹2 L/yr - ₹9 L/yr |
Team Lead
1.8k
salaries
| ₹1.2 L/yr - ₹10 L/yr |
Operations Executive
1.8k
salaries
| ₹1.2 L/yr - ₹6.3 L/yr |
Assistant Manager
1.6k
salaries
| ₹5.9 L/yr - ₹21 L/yr |
Data Entry Operator
1.5k
salaries
| ₹0.6 L/yr - ₹4 L/yr |
Amazon
Myntra
Snapdeal
Meesho