i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There was 1 interview round.
I have a Bachelor's degree in Quality Management, 5 years of experience in quality assurance, and successfully implemented a new quality control system.
Bachelor's degree in Quality Management
5 years of experience in quality assurance
Implemented a new quality control system
I use a combination of root cause analysis, brainstorming, and data analysis to solve problems efficiently.
Identify the root cause of the problem before jumping to solutions
Brainstorm potential solutions with a team or individually
Use data analysis to make informed decisions and track progress
Implement solutions and monitor results for effectiveness
Adjust strategies as needed based on feedback and outcomes
I implemented a new quality control system that improved efficiency by 20% through individual contributions and team collaboration.
Implemented a new quality control system to streamline processes
Led training sessions for team members to ensure understanding and compliance
Collaborated with cross-functional teams to identify and address quality issues
Introduced regular quality audits to monitor and improve performance
I have closely worked with supply chain operations and would implement process improvements to reduce picking time in the warehouse.
I have collaborated with supply chain teams to optimize inventory management and streamline processes.
Implemented barcode scanning technology to improve accuracy and efficiency in picking orders.
Analyzed data to identify bottlenecks in the picking process and implemented solutions such as ...
Implementing lean principles such as 5S, Kanban, and Just-in-Time inventory management can help reduce SCM operations in a warehouse.
Implement 5S methodology to organize the warehouse and reduce waste
Utilize Kanban system to optimize inventory levels and streamline processes
Adopt Just-in-Time inventory management to minimize excess inventory and improve efficiency
I was responsible for overseeing the day-to-day operations, ensuring efficiency and productivity.
Managed a team to ensure smooth operations
Implemented process improvements to increase efficiency
Monitored key performance indicators to track productivity
Collaborated with other departments to streamline operations
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
Describe a situation where you had to handle a crisis in the operation.
Identify the root cause of the crisis
Assess the severity of the situation
Communicate effectively with all stakeholders
Develop and implement a plan of action
Monitor the situation closely and make necessary adjustments
Evaluate the effectiveness of the response and make improvements for the future
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I appeared for an interview before Apr 2021.
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.
Given a string STR
consisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.
The first line contains an inte...
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...
Given a string S
that represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ...
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
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.
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...
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).
Given an integer array ARR
and an integer K
, your task is to find the K
most frequent elements in ARR
. Return the elements sorted in ascending order.
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.
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
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...
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.
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
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.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
In the interview I was asked few puzzles and few coding problems.
In the coding questions the interviewers did not ask me to write down the complete codes of the problems, they only asked me to suggest some suitable algorithms.
Given a positive integer N
, find the total number of '1's in the binary representation of all the numbers from 1 to N
.
You should return the result modulo 109+7 as the co...
Count the total number of set bits in the binary representation of numbers from 1 to N, modulo 10^9+7.
Iterate through numbers from 1 to N and count the set bits in their binary representation
Use bitwise operations to count set bits efficiently
Return the total count modulo 10^9+7 as the result
Round duration - 45 minutes
Round difficulty - Easy
In second round of interview I was asked some hardcore programming questions on data structures since I wrote it as my area of interest.
I was asked some puzzles as well.
Given two sorted integer arrays ARR1
and ARR2
of size M and N, respectively, merge them into ARR1
as one sorted array. Assume that ARR1
has a size of M + N to hol...
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in both arrays
Handle cases where one array is fully merged before the other
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.
based on 1 interview
Interview experience
based on 7 reviews
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹6.8 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.5 L/yr |
Associate
2.9k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
Senior Associate
2.3k
salaries
| ₹2 L/yr - ₹10.5 L/yr |
Program Manager
2.1k
salaries
| ₹9 L/yr - ₹36 L/yr |
Flipkart
TCS
Netflix