AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon Production Supervisor Interview Questions and Answers
Amazon Production Supervisor Interview Experiences
1 interview found
Mahesha G R
Selected
I appeared for an interview before Jun 2024, where I was asked the following questions.
- Q1. How many years work experience
- Ans.
I have over 8 years of experience in production supervision, leading teams and optimizing processes for efficiency.
Managed a team of 15 production workers for 5 years, improving output by 20%.
Implemented lean manufacturing techniques that reduced waste by 30%.
Conducted training sessions for new hires, enhancing team productivity.
Collaborated with quality control to ensure compliance with safety standards.
- Q2. Data update in system
- Ans.
Data updates in a system ensure accuracy and efficiency in production processes.
Regularly schedule data updates to maintain system integrity.
Implement automated data entry to reduce human error, e.g., using barcode scanners.
Conduct periodic audits to verify data accuracy and completeness.
Train staff on the importance of timely data updates and system usage.
- Q3. Ho to handle to station
- Ans.
Effective station handling involves organization, communication, and proactive problem-solving to ensure smooth operations.
Maintain a clean and organized workspace to enhance efficiency and safety.
Implement clear communication channels among team members to avoid misunderstandings.
Regularly monitor production metrics and adjust processes as needed to meet targets.
Conduct training sessions to ensure all team members are...
Interview Preparation Tips
Interview questions from similar companies
Anonymous
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .
- Q1.
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are
Nneighbors living at different points on the plane. Your goal is to visit exactlyKneighb... - Ans.
Find the K closest points to the origin in a 2-D plane using Euclidean Distance.
Calculate the Euclidean Distance of each point from the origin
Sort the points based on their distances
Return the first K points as the closest neighbors
- Q2.
Power Set Generation
Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.
A power set of a set 'ARR' i...
- Ans.
Generate the power set of a sorted array of integers with individually sorted subsets.
Use recursion to generate all possible subsets by including or excluding each element in the array.
Sort each subset before adding it to the power set.
Handle base cases for empty array and single element array.
Ensure the subsets are unique by using a set data structure.
Time complexity can be exponential due to the nature of generating ...
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Hard
This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .
- Q1.
Roman Numeral to Integer Conversion
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Explanation:
Roman numerals are represented by seven different symbol...
- Ans.
Convert a Roman numeral string to its integer equivalent.
Create a mapping of Roman numeral symbols to their integer values.
Iterate through the input string and add the corresponding integer values.
Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).
- Q2.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the question.
Return the sorted list of pairs.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.
- Q1.
Arithmetic Expression Evaluation Problem Statement
You are provided with a string
expressionconsisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express... - Ans.
Evaluate arithmetic expressions in infix notation with given operators and precedence rules.
Parse the infix expression to postfix using a stack.
Evaluate the postfix expression using a stack.
Handle operator precedence and parentheses while evaluating.
Ensure no division by zero cases and operands fit in 32-bit integer.
- Q2.
Remove Duplicates from Sorted Array Problem Statement
You are given a sorted integer array
ARRof sizeN. Your task is to remove the duplicates in such a way that each element appears only once. The outpu... - Ans.
Remove duplicates from a sorted array in-place with O(1) extra memory.
Use two pointers - one for iterating through the array and another for placing unique elements.
Compare current element with next element to identify duplicates and skip them.
Update array in-place by moving unique elements to the front.
Return the length of the array after removal of duplicates.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .
- Q1. How does Facebook store likes and dislikes?
- Ans.
Facebook stores likes and dislikes using a combination of databases and algorithms.
Likes and dislikes are stored in databases such as MySQL or Cassandra.
Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.
User interactions with posts, pages, and ads are tracked to determine likes and dislikes.
Likes and dislikes may also be used to personalize the user's feed and target ads mor...
- Q2. How does Facebook implement graph search?
- Ans.
Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.
Facebook uses a graph database to store connections between users, pages, groups, etc.
The graph search algorithm traverses the graph to find relevant connections based on user queries.
It takes into account factors like user relationships, interests, and interactions to provide personalized sea...
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.
- Q1. What is Hadoop and why is it used?
- Ans.
Hadoop is a framework for distributed storage and processing of large data sets.
Hadoop is used for storing and processing big data across a distributed network of computers.
It is based on the MapReduce programming model, which allows for parallel processing of data.
Hadoop consists of HDFS for storage and YARN for resource management.
It is used for tasks like data warehousing, log processing, recommendation systems, and...
- Q2. How does Facebook Chat work?
- Ans.
Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.
Facebook Chat uses websockets for real-time communication between the client and server.
Long polling is used to check for new messages when websockets are not supported.
Push technology is used to notify users of new messages even when the chat window is not open.
Messages are stored in a database an...
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
Interview Preparation Tips
Tips: Just try coding as much as you can in the four years of graduation.
Round: Interview
Experience: Three Coding Interview and a Behavioral Interview were conducted.
Tips: Try to get some prior knowledge about the company's infrastructure.w
General Tips: Practice as much problems as you can online or offline.
Skill Tips: Coding is the key for any software company.
Skills: Coding
College Name: IIT KHARAGPUR
Motivation: Its the best in business
Interview Questionnaire
4 Questions
- Q1. You are given a large array of n bits. Each bit is initially 0. You perform several operations of the type
- Ans.
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
- Q2. Questions on Network programming
- Q3. Questions on array,heap and binary trees
- Q4. Round was both HR+Technical
Interview Preparation Tips
Experience: Questions can be found here:
-----/
Tips: Try to solve all 3.
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: First discuss the solution and then paper-code it.
Tips: Try to code without mistakes.
Round: Technical Interview
Experience: First, I was asked to discuss my project based on networking and then I was given a question on network programming
Tips: Pay attention on discussion
Round: Technical Interview
Experience: Provide the optimised solution and code it without any mistakes.
Round: HR Interview
Experience: Why linkedin?
What changes will you make in 6 months?
Internship project: Discussion and lot of common questions on that.
Basic Questions of C++ and Java
Skills: Data Structure, Core courses understanding, Algorithms
College Name: IIT GUWHATI
Skills evaluated in this interview
What people are saying about Amazon
I appeared for an interview before Mar 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.
- Q1.
Ninja and Sorted Array Merging Problem
Ninja is tasked with merging two given sorted integer arrays
ARR1andARR2of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w... - Ans.
Merge two sorted arrays into one sorted array in place.
Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.
Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.
Continue this process until all elements from ARR2 are merged into ARR1.
- Q2.
Word Distance Calculation
Given a document represented as an array/list
ARRof words with lengthN, find the smallest distance between two given words for multiple queries. The distance is defined as the ... - Ans.
Find the smallest distance between two words in a document for multiple queries.
Iterate through the document array to find the indices of the two words in each query.
Calculate the absolute difference between the indices to get the distance.
If a word from the query is not present in the document, return the length of the document array.
Repeat the process for each query and output the smallest distance for each.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Then in the second round they asked a little about tree and told me to code 2 codes.
- Q1.
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te... - Ans.
The problem requires implementing a function to return the level order traversal of a binary tree.
Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.
Use a queue data structure to perform level order traversal.
Process each level of the tree one by one, starting from the root node.
Print the node values at each level in the order they appear from left to ...
- Q2.
Combination Sum Problem Statement
Given an array of distinct positive integers
ARRand a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c... - Ans.
Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
Use backtracking to generate all possible combinations.
Sort the array to ensure elements are in non-decreasing order.
Track the current combination and sum while backtracking.
Terminate recursion when the sum equals the target sum.
Avoid duplicates by skipping elements that have been used in previou...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.
- Q1.
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
- Ans.
The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using modulo 10^9+7 to avoid overflow in calculations.
- Q2.
Optimal Strategy for a Coin Game
You are playing a coin game with your friend Ninjax. There are
Ncoins placed in a straight line.Here are the rules of the game:
1. Each coin has a value associated wit... - Ans.
The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.
Start by understanding the rules of the game and how players take turns to choose coins.
Consider the scenario where both players play optimally to maximize winnings.
Iterate through different strategies to determine the best approach for selecting coins.
Keep track of the total winnings accumulated by eac...
- Q3.
Generate All Parentheses Combinations
Given an integer
N, your task is to create all possible valid parentheses configurations that are well-formed usingNpairs. A sequence of parentheses is considered w... - Ans.
Generate all possible valid parentheses configurations using N pairs.
Use backtracking to generate all possible combinations of parentheses.
Keep track of the number of open and close parentheses used.
Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.
Base case: when the length of the generated string is 2*N, add it to the result array.
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
Interview Preparation Tips
College Name: NA
Interview Preparation Tips
Experience: In the coding round there were 3 questions to be solved in about 3 hrs.
Round: HR Interview
Experience: Expect the usual crazy questions like "Why LinkedIn?" and if you are already placed, be ready to give a proper justification for "Why LinkedIn and not XYZ?" so on. Be cool, you need not be accurate. Be well prepared with your resume and expect questions from them.
Tips: For the interview, just be confident and have a good resume ready with you.
Round: Other Interview
Experience: Coding Interview:
Simple coding questions. Make sure you first explain the logic to them and then you may be asked to write the code for it on the board using any language of your choice. Syntax is not a big deal, but don't make any logical errors. They are very friendly and may suggest certain solutions of their own. Make sure you can grasp them quickly. Find faults in your own code before they find it. Always try to give the best optimal solution. In case you are unable to do so then suggest possible improvements.
Round: Other Interview
Experience: Design Interview:
Some people may find this round a bit uneasy. But this round tests how good you are at designing solutions to problems. Most of the candidates were asked to build an online gaming system. And then they keep adding extra constraints and ideas and see if you can integrate them to your design. Database knowledge may be tested. They may also ask questions pertaining to you projects listed in your resume.
General Tips: An updated LinkedIn account with decent connections. ;)
Skill Tips: Be very strong with your coding ability. Whenever you code, do follow some standard procedures and make the code look simple and structured. Whenever you solve a coding question make sure you answer it completely for all the test cases. Partial results will only indicate that there is something wrong with the logic. Try to solve a complete question rather than multiple questions with partial results.
College Name: NIT SURATHKAL
Interview Preparation Tips
Experience: Three questions of increasing difficulty level. The first one was on string manipulation, the second was based on the iterative version of the merge sort algorithm and the last one on dynamic programming.
Total Questions: 3
Round: Other Interview
Experience: Eight students were selected for this stage which consisted of three separate interviews. The first one was on algorithms and programming, the second on system design and the third was HR. In the algorithms and programming interview I was asked two questions. The interviewer asked me to first explain the proposed algorithm and then I was expected to write the code on a white board they had provided. Three weeks after the interviews the selected candidates were informed through the concerned placement coordinator.
General Tips: Don't panic, the interviewers don't expect you to come up with the optimum result directly and they will give you enough time to refine your solution.
Skill Tips: No special preparation is required. Just make sure that you have understood the fundamentals
of Data Structures and Algorithms well.
College Name: NIT SURATHKAL
Interview Preparation Tips
College Name: NIT SURATHKAL
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Production Engineer Interview Questions
- Junior Engineer Interview Questions
- Supervisor Interview Questions
- Operations Manager Interview Questions
- Production Manager Interview Questions
- Production Officer Interview Questions
- Senior Officer Interview Questions
- Senior Production Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Interview Questions from Similar Companies
Amazon Production Supervisor Reviews and Ratings
based on 14 reviews
Rating in categories
|
Customer Service Associate
4.1k
salaries
|  ₹0.6 L/yr - ₹5 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.3 L/yr |
|
Associate
3k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
|
Senior Associate
2.6k
salaries
| ₹1.8 L/yr - ₹9 L/yr |
|
Software Developer
2.2k
salaries
| ₹24.3 L/yr - ₹48.7 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions
