AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon Program Analyst Interview Questions, Process, and Tips
Amazon Program Analyst Interview Experiences
1 interview found
Anonymous
I was interviewed in Sep 2021.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Hard
It was a online video proctored test which had a lot of sections and questions were different for everybody. Sections were on coding, DS, Algo, Networks,DBMS,Software Engg and Testing techniques. The test has medium to difficult level of questions. I got the coding question as longest common subsequence in strings which i solved all the testcases. There was no negative marking. I fcoused on coding,ds,algo,networks and dbms and i was selected for the face to face interview. They roles were alloted according to the performance in the online test.
- Q1.
Longest Common Subsequence Problem Statement
Given two strings
STR1andSTR2, determine the length of their longest common subsequence.A subsequence is a sequence that can be derived from another sequen...
- Ans.
The task is to find the length of the longest common subsequence between two given strings.
Implement a function to find the longest common subsequence between two strings
Use dynamic programming to solve the problem efficiently
Iterate through the strings to find the common subsequence
Handle edge cases like empty strings or strings with no common subsequence
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
I had the interview in Amazon Chime, the interviewer was very friendly and firstly she asked me to introduce myself and them she told about herself. She also worked with java mainly and i was pretty happy to hear that. They screen has to be presented the whole time and there was also live coding.
- Q1.
Find Pair With Smallest Difference Problem Statement
Given two unsorted arrays of non-negative integers,
arr1andarr2with sizesNandM, determine the pair of elements (one from each array) which have t... - Ans.
Find the pair of elements with the smallest absolute difference from two unsorted arrays.
Sort both arrays to simplify finding the pair with the smallest difference.
Use two pointers approach to iterate through both arrays and find the pair with the smallest difference.
Keep track of the minimum absolute difference and update it as you find smaller differences.
Return the minimum absolute difference once all pairs have bee
- Q2.
Closest Sum Problem Statement
Given an array of integers
ARRof sizeNand an integertarget, find three integers inARRsuch that their sum is closest to thetarget. If there are two closest sums, return... - Ans.
The task is to find three integers in an array whose sum is closest to a given target.
Iterate through all possible triplets in the array to find the closest sum to the target.
Keep track of the closest sum found so far and update it if a closer sum is found.
Return the closest sum found after iterating through all triplets.
(2 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
This round was pretty long for me as it lasted for 90 min. The interviewer was very friendly. She helped me with the problems and gave me hints for optimizing the problem.At the end i was asked some personal questions and some questions on the internship i mentioned in my resume.
- Q1.
Sum of Big Integers Problem Statement
Given two integers represented as strings, 'NUM1' and 'NUM2', compute and return their sum.
Input:
T
NUM1 NUM2
...Output:
Sum of NUM1 and NUM2 for each test case...
- Ans.
Program to compute sum of big integers represented as strings.
Convert strings to integers and add them digit by digit from right to left, considering carry over.
Handle cases where one number is longer than the other by padding with zeros.
Return the final sum as a string.
- Q2.
Longest Common Prefix Problem Statement
You are given an array ‘ARR’ consisting of ‘N’ strings. Your task is to find the longest common prefix among all these strings. If there is no common prefix, you ha...
- Ans.
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with corresponding characters of other strings.
Stop when a character doesn't match or reach the end of any string.
Return the prefix found so far as the longest common prefix.
Interview Preparation Tips
Tip 1 : Be proficient in coding as it is basic requirement to get selected in any company.
Tip 2 : Try to be confident in the interviews and do not fake in your resume, the interviewer are too smart and catch any lie easily
Tip 3 : Practice a lot of mock company exams on sites like Coding Ninjas, GeeksForGeeks etc.
Tip 4 : Know about your projects inside out. Lot of questions will be asked related to that.
Tip 1 : Make your resume neat and clean, do not try fancy things and don't just stuff things to fill space.
Tip 2 : Refer to resumes from seniors
Tip 3 : Send it to friends and others for corrections and improvements.
Skills evaluated in this interview
Program Analyst Jobs at Amazon
Interview questions from similar companies
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
Adithya H K Upadhya
Interview Preparation Tips
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.
Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).
General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal
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
I was interviewed before Apr 2021.
(1 Question)
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.
- Q1.
Count Set Bits Problem Statement
Given a positive integer
N, find the total number of '1's in the binary representation of all the numbers from 1 toN.You should return the result modulo 109+7 as the co...
- Ans.
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
(1 Question)
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.
- Q1.
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays
ARR1andARR2of size M and N, respectively, merge them intoARR1as one sorted array. Assume thatARR1has a size of M + N to hol... - Ans.
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
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 Questionnaire
1 Question
- Q1. Questions based on tree
Interview Preparation Tips
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30
Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax
Skills: Thinking Process
College Name: IIT GUWHATI
Piyush Raman
Interview Questionnaire
7 Questions
- Q1. Discussion on internship at IBM' Cloud Unit
- Q2. Find LCM of all numbers from 1 to n. Give an algorithm, then correctly estimate the time complexity
- Ans.
Algorithm to find LCM of all numbers from 1 to n and its time complexity
Find prime factors of all numbers from 1 to n
For each prime factor, find the highest power it appears in any number from 1 to n
Multiply all prime factors raised to their highest power to get LCM
Time complexity: O(n*log(log(n)))
- Q3. SQL vs NoSQL. Why NoSQL
- Ans.
NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.
NoSQL databases are schema-less, allowing for easy and flexible data modeling.
They can handle large amounts of unstructured data, making them suitable for big data applications.
NoSQL databases are highly scalable and can easily handle high traffic and large user bases.
They provide horizontal scalability by distributing data across...
- Q4. Some DBMS designing question relating to Snapdeal website
- Q5. JAVA-Spring and Hibernate
- Q6. Variation of -----/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n
- Ans.
The question asks to find the count of words in a dictionary that can be formed by a given number.
Iterate through each word in the dictionary
Check if the characters in the word can be formed using the given number
Increment the count if the word can be formed
- Q7. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H...
Interview Preparation Tips
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23
Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles
Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.
Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree
Round: HR Interview
Experience: Typical HR
General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -
Skills evaluated in this interview
Interview Preparation Tips
Experience: I had a standard resume for this company as per our institute placement cell norms.
I prepared resume keeping in mind the areas of interest that would suit the company’s requirements. The companies that recruit students from all departments usually tend to recruit students seeking interests in subjects related to management. I knew about this and while applying to non-core companies I specified my areas of interest as these subjects.
Round: Test
Experience: The first round was the written test. The paper was composed of general aptitude and basic programming questions. For programming questions we were told that in case we did not know the desired syntaxes we could write the algorithm for the problems. Since I was not a proficient coder I preferred writing only the algorithm for the coding questions. There were also some logical reasoning questions (mainly puzzle types). For example in one of the questions we were given a multi coloured cube with each side having a different colour. Initially the cube was kept with the blue colour appearing on the top surface; then the cube was rotated along various axes, we had to specify which colour would appear on the top surface. I qualified the first round.
Round: HR Interview
Experience: The second round was an aptitude interview round. In this interview I was asked about the preference with respect to the profiles ordered (programming or analytics). I replied that I would like to join the company as an analyst, however if given an option I would be open to learning programming as well. The interviewers were delighted to know about my interests in learning newer things.
The interview further asked me puzzle based logical reasoning questions like ‘How to find the odd coin out of 8 coins of which 7 are similar in all senses in two weighing steps by use of a balance?’ He asked me few more of these types; I successfully managed to answer all these questions.
Round: HR Interview
Experience: The final round was again a personal interview. This was actually supposed to be a profile specific interview; however since I had earlier said that I was open to getting recruited in both the profiles they asked me questions from programming as well as analytical questions. I informed them again that I was interested in learning programming but did not have much clue about it at that time. They did not pay any heed whatsoever to my plea and kept asking me questions related to programming. They asked me some questions and told me to suggest some algorithm for those questions since I did not know coding. I framed some algorithms but they did not seem very convinced with my answers. Eventually I was not recruited.
Tips: As per my experience I would say that knowledge about C++ is necessary to get into the software section of Snapdeal. They want people who are well versed with puzzle solving questions and who can solve analytical questions easily.
College Name: IIT ROORKEE
Motivation: I got to know about the company and the profile through the pre-placement talk by the company. The company is one of the leading e-commerce website today and is quite famous among the youth. Hence I had knowledge about its existence and field of work beforehand.
Interview Questionnaire
16 Questions
- Q1. Lowest Common Ancestor of two nodes in binary tree.I wrote code for this.Then interviewer drew a tree and asked to print stacktrace on it
- Ans.
Finding lowest common ancestor of two nodes in binary tree
Traverse the tree from root to both nodes and store the paths in separate arrays
Compare the paths to find the last common node
Return the last common node as the lowest common ancestor
Use recursion to traverse the tree efficiently
- Q2. You are given two ropes.Each rope takes exactly 1 hour to burn. How will you measure period of 45 minutes
- Q3. Singleton Design pattern
- Q4. Two linked list are merging at a point.Find merging point
- Ans.
To find the merging point of two linked lists
Traverse both linked lists and find their lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
- Q5. Reverse linked list without recursion
- Ans.
Reverse a linked list iteratively
Create three pointers: prev, curr, and next
Initialize prev to null and curr to head
Loop through the list and set next to curr's next node
Set curr's next node to prev
Move prev and curr one step forward
Return prev as the new head
- Q6. Number of rectangles in MxN matrix
- Ans.
The number of rectangles in an MxN matrix can be calculated using a formula.
The formula is (M * (M + 1) * N * (N + 1)) / 4
The matrix can be divided into smaller sub-matrices to count the rectangles
The number of rectangles can also be calculated by counting all possible pairs of rows and columns
- Q7. All anagrams of a string.He called it anagram but i think he wanted to ask all possible substrings of a string
- Q8. Which Design patterns you have used.I said Decorator,Factory,Singleton.Then he asked about Decorator design pattern
- Q9. Tell me about yourself.Then by looking at my resume he said you don’t have hands on experience in Java as i was working in php.I said though i don’t have hands on experience but i am good in programming an...
- Q10. There is four digit number in aabb form and it is a perfect square.Find out the number
- Ans.
The number is 7744.
The number must end in 00 or 44.
The square root of the number must be a whole number.
The only possible number is 7744.
- Q11. You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,...
- Q12. Same tell me about yourself
- Ans.
I am a software developer with experience in multiple programming languages and a passion for problem-solving.
Proficient in Java, Python, and C++
Experience with web development using HTML, CSS, and JavaScript
Familiarity with agile development methodologies
Strong problem-solving and analytical skills
Passionate about learning new technologies and staying up-to-date with industry trends
- Q13. There is a file which contains ip addresses and corresponding url. Example 192.168.1.15 www.abc.com 10.255.255.40 ----- You have to return the subnet mask of the ip and the url after “www.” Output 192.1...
- Ans.
Java function to return subnet mask of IP and URL after www.
Read the file and store IP addresses and URLs in separate arrays
Use regex to extract subnet mask from IP address
Use substring to extract URL after www.
Return subnet mask and URL as separate strings
- Q14. 3 mislabeled jar puzzle.Since i had heard this puzzle many times,i answered it in 2-3 minutes.He said i can make out that you have heard this puzzle already ;)
- Q15. What are inner join and outer join in sql
- Ans.
Inner join returns only the matching rows between two tables, while outer join returns all rows from one table and matching rows from the other.
Inner join combines rows from two tables based on a matching column.
Outer join returns all rows from one table and matching rows from the other.
Left outer join returns all rows from the left table and matching rows from the right table.
Right outer join returns all rows from the...
- Q16. A linked list contains loop.Find the length of non looped linked list
- Ans.
To find the length of non-looped linked list, we need to traverse the list and count the number of nodes.
Traverse the linked list using a pointer and count the number of nodes until the end of the list is reached.
If a loop is encountered, break out of the loop and continue counting until the end of the list.
Return the count as the length of the non-looped linked list.
Interview Preparation Tips
Experience: 3.You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,5…10. What was the original sequence of card.After doing some exercise i answered 1,6,2,10,3,7,4,9,5,8.Then he asked me to write a function for this which takes a number and return the array.
Skills: Algorithm, Java, OOP, data structure
College Name: NA
Skills evaluated in this interview
Amazon Interview FAQs
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Customer Service Executive 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
- Programmer Analyst Interview Questions
- Programmer Analyst Trainee Interview Questions
- Programmer Interview Questions
- Trainee Programmer Interview Questions
- Technical Program Manager Interview Questions
- Senior Program Manager Interview Questions
- Program Analyst Trainee Interview Questions
- Senior Programmer Analyst Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
Customer Service Associate
4.2k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Associate
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Associate
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Program Manager
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions >
- Amazon Program Analyst Interview Questions
