Amazon

Amazon Interview Questions and Tips

Showing 1 - 10 of 41 interviews

1

Amazon Sde (software development engineer) interview

, 2.2k views
Anonymous2-3 yr work ex.Selected
Interview Process
Resume Shortlist Test Test Technical Interview
Round 1

Resume Shortlist

Interview Experience
Applied through referral and after the review my resume gets shortlisted.
Round 2

Test

Duration
11 Hours 20 Minutes
No. of Questions
6 questions
Test Sections
  • Section 1: Debugging test
Interview Experience
6 program and their outputs are given. We have debug the program to get the desired output.
Round 3

Test

Duration
1 Hours
No. of Questions
2 questions
Test Sections
  • Section 1: Hacker rank
Interview Experience
Have to write a code for 2 problems.
Round 4

Technical Interview

Interview Questions
  • Question 1: Write a program to calculate the sum of level order tree
Skills

Skills Tested

  • Behavioural Skills
  • LOGICAL THINKING ABILITIES
  • Technical Skill
Read Full post...
2

Amazon Intern interview

, 2.3k views
AnonymousFresherSelected
Application
I was interviewed on-campus for Intern role at Amazon in Aug, 2016
Interview Process
Technical Interview Technical Interview
Round 1

Technical Interview

Interview Questions
  • Question 1: To reverse Linked List in pair of three.
  • Question 2: Search a number in sorted rotated array.
Interview Experience
Interviewer mainly focused on problem solving skill.
Round 2

Technical Interview

Interview Questions
  • Question 1: A dynamic programming question was there to find a path in matrix.
Skills

Skills Tested

  • Algorithm
Read Full post...
3

Amazon As pee the company's requirement internship interview

, 2.3k views
AnonymousFresherNot Selected
Application
I was interviewed on-campus for As pee the company's requirement role at Amazon in Nov, 2016
Interview Process
Test Technical Interview
Round 1

Test

Duration
1 Hours 30 Minutes
No. of Questions
40 questions
Test Sections
  • Section 1: Logical
  • Section 2: Quantitative
  • Section 3: Technical
Interview Experience
Online was performed in a precise way.
Interview Tips
No illegal means are allowed.
Round 2

Technical Interview

Interview Questions
  • Question 1: A question writing about code of binary search was given to me.
  • Question 2: What is data base algorithm? What do you know about it?
Interview Experience
It was a tough technical round. It went on a very stress note.
Interview Tips
Calm yourself and go for it.
Read Full post...
4

Amazon As per the company's requirement. interview

, 2.3k views
AnonymousFresherNot Selected
Application
I was interviewed on-campus for As per the company's requirement. role at Amazon in Nov, 2016
Interview Process
Test Technical Interview
Round 1

Test

Duration
1 Hours 30 Minutes
No. of Questions
45 questions
Test Sections
  • Section 1: logical
  • Section 2: quantitative
  • Section 3: technical
Interview Experience
Online tests were performed as per the process of the company.
Interview Tips
Thorough practice for online tests is a must.
Round 2

Technical Interview

Interview Questions
  • Question 1: To write a code on binary search.
  • Question 2: Questions based on java .
  • Question 3: Questions based on Data structure algorithms.
Interview Experience
The whole process was very hectic.It went for about 30 minutes.
Read Full post...
5

Amazon Software development engineer interview

, 21.6k views
AnonymousFresherNot Selected
Application
I was interviewed on-campus for Software development engineer role at Amazon in Feb, 2017
Interview Process
Test
Round 1

Test

Duration
1 Hours 30 Minutes
No. of Questions
22 questions
Test Sections
  • Section 1: (a) Test is divided in two sections : MCQ’s and Coding (b) MCQ’s (Multiple Choice Question’s) are a total of 20 with one mark each for correct answers and 0.25 marks as negative marking for a wrong answer (c) Coding are a total of 2 questions with 10 marks each and no negative markin
Interview Experience

1) A, B and C jointly thought of engaging themselves in a business venture. It was agreed that A would invest Rs. 6500 for 6 months, B, Rs. 8400 for 5 months and C, Rs. 10,000 for 3 months. A wants to be the working member for which, he was to receive 5% of the profits. The profit earned was Rs. 7400. Calculate the share of B in the profit.

2) Convert ”(/ (+ (* (+ 2 3) 4) 6) (/ (+ (* 7 3) 4) 6))” into the equivalent infix notation.
a) ((2 + 3) * 4) + 6) / ((7 * 3) + 4) / 6)
b) ((3 * 2) + 4) + 6) / ((3 + 7) * 4) + 6)
c) ((2 + 3) * 4) + 6)) / ((7 * 3) + 4) + 6)
d) ((2 + 3) * 4) + 6)) + ((7 / 3) + 4) + 6)

3) A hash table contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is ( Key % 10 ). If the values 43, 165, 62, 123, 142 are inserted in the table, in what location would the key value 142 be inserted? Linear probing is a method for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs and looking up the value associated with a given key. When the hash function causes a collision by mapping a new key to a cell of the hash table that is already occupied by another key, linear probing searches the table for the closest following free location and inserts the new key there.
a) 2
b) 3
c) 4
d) 6

4) The percentage increase in the area of a rectangle, if each of its sides is increased by 20% is:

5) The total number of ways in which a 5 digit number divisible by 3 can be formed from the digits 0, 1, 2, 3, 4, 5 without repetition is?


6) Which of the following sorting algorithms does not have a worst case running time of 0(n )

7) Darin is standing on vertex A of triangle ABC, with AB = 3, BC = 5, and CA = 4. Darin walks according to the following plan: He moves along the altitude-to-the-hypotenuse until he reaches the hypotenuse. He has now cut the original triangle into two triangles; he now walks along the altitude to the hypotenuse of the larger one. He repeats this process forever. What is the total distance that Darin walks?
a) 15
b) 12
c) 12/5
d) 46/5

8) If each node in a binary tree has a value greater than every value in its left subtree and less than every value in its right subtree, it is known as
a) complete tree
b) full binary tree
c) binary search tree
d) threaded tree

9) Let P be the quicksort program where the larger of the first two distinct elements is chosen as the pivot element. Which of the following input permutations will lead to the best performance of P?
a) [1 2 3 4]
b) [4 3 2 1]
c) [1 3 2 4]
d) [1 3 4 2]

10) By using some sorting technique, an array of 8 elements was sorted and the sorting algorithm found the largest number first. The elements of the array are in the order: 2 4 5 7 8 1 3 6 after 4 iterations. Based on above condition(s) which statement would be valid?
a) Algorithm would be neither merge sort nor insertion sort.
b) Algorithm would be insertion sort not merge sort.
c) Algorithm is selection sort.
d) None

11) Indicate which is a pre-emptive scheduling algorithm
a) Round-Robin
b) Shortest-job-next
c) Priority –based
d) None of the above
e)
12) Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
a) A queue cannot be implemented using this stack.
b) A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.
c) A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.
d) A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.

13) A man spent 1/3rd of his life as a bachelor. After ten years of his marriage a son was born to him. The father and son died in an accident and at that time father's age was double that of son. What is the father's age at the time of death?
a) 50
b) 60
c) 70
d) 80

14) Two cars start towards each other at the same time. One travels at 60 km/hr and another at 90 km/hr. A bird starts with one of the cars and flies at 400 km/hr towards the other one. When it gets to the other car, it turns and flies back towards the first and continues this to and fro flying when the cars are moving towards each other. How far does the bird travel before the cars pass each other? The distance between the cars is 3000 km.
a) 5000 km
b) 6000 km
c) 7000 km
d) 8000 km

15) A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?
a) 32
b) 48
c) 64
d) 96

16) Big (O) notation...
a) decides the best algorithm to solve a problem
b) determines maximum size of a problem, that can be solved in given system in given time
c) is the lower bound of growth rate of an algorithm
d) is the upper bound of growth rate of an algorithm

17) The post-order and preorder traversal of a binary tree are D E B F G C A and A B D E C F G respectively The in-order traversal of the binary tree is.
a) D B E A F C G
b) E D B G F C A
c) E D B F G C A
d) D E F G B C A

18) If we implement a queue using a circular linked list, what is the minimum number of pointers that would suffice to implement the enqueue and dequeue operations?
a) 1
b) 2
c) 3
d) as many as the number of elements in the queue

19) 4 out of 15 apples are rotten. They are taken out one by one at random and examined. The ones which are examined are not replaced. What is the probability that the 9th one examined is the last rotten one?
a) 8/195
b) 1/7
c) 56/200
d) None of the above
20) 125 gallons of mixture of milk and water contains 20% water. What amount of water needs to be added to this milk-water mixture in order to increase the percentage of water to 25% of the new mixture?
a) 5.66
b) 7
c) 8.33
d) 9
Coding
1. Given a string containing alphanumeric characters, calculate sum of all numbers present in the string.
Sample Input 1Amazon28Interview2
Sample Output 31
2. Number Game Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of ways to reach the given score.
Explanation There are following four ways to reach 20: (10, 10) (5, 5, 5, 5) (5, 5, 10) (3, 3, 3, 3, 3, 5)
Skills

Skills Tested

  • Data Structures And Algorithms
Read Full post...
6

Amazon Software engineer interview

, 2.8k views
Rajesh PSFresherSelected
Application
I was interviewed on-campus at Sri ganesh college of engineering and technology for Software engineer role at Amazon in Oct, 2016
Interview Process
Test Behavioural Interview Technical Interview
Round 1

Test

Duration
1 Hours 30 Minutes
No. of Questions
40 questions
Test Sections
  • Section 1: Aptitude round
Interview Experience
Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Interview Tips
Just think well before u do..
Round 2

Behavioural Interview

Interview Experience
It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..
Interview Tips
Beware filling ur resume.. they will ask every stuff that you have in resume
Round 3

Technical Interview

Interview Experience
Discussion about my project that i vr done in my final year.they asked me what was my role in my project
Read Full post...
7

Amazon Software development engineer interview

, 4.6k views
Amit PandeyFresherSelected
Application
I was interviewed on-campus at NIT Allahabad for Software development engineer role at Amazon in Jul, 2015
Interview Process
Test Technical Interview Technical Interview Technical Interview
Round 1

Test

Duration
1 Hours 30 Minutes
No. of Questions
22 questions
Test Sections
  • Section 1: Coding
  • Section 2: MCQs
Interview Experience
On campus coding round.29 shortlisted from approx 500 students.
20 MCQs and 2 coding questions.
The coding questions carried equal and high weightage as compared to the MCQs.The coding questions were
1. Check whether a linked list is a palindrome or not.
2.Print a 2D matrix in a spiral manner
Interview Tips
Selection depends on the performance of the students.If you pass all the test cases in both the coding questions fully, then you might be shortlisted.
Round 2

Technical Interview

Interview Questions
  • Question 1: http://www.spoj.com/problems/MIXTURES/. They may ask for code.
  • Question 2: Given an infinite stream of string URLs, suggest a data structure to answer the following question in least possible time. Question: Which is the oldest unique (not reapeated) URL till now?
  • Question 3: Discussion about projects.
Round 3

Technical Interview

Interview Questions
  • Question 1: http://www.geeksforgeeks.org/connect-leaves-doubly-linked-list/
  • Question 2: http://www.geeksforgeeks.org/count-frequencies-elements-array-o1-extra-space-time/
  • Question 3: Open and closed chain hashing in database. Probing (Linear, quadratic )
Interview Experience
Code required for both the questions.Be careful of the corner cases.
Interview Tips
Be calm and composed.Sufficient time is given to think and code.
Round 4

Technical Interview

Interview Questions
  • Question 1: http://www.geeksforgeeks.org/segregate-0s-and-1s-in-an-array-by-traversing-array-once/
  • Question 2: Implement the "People you may know" feature of facebook with code. Use BFS and counter (for mutual friends).
Interview Experience
This interview was last interview before the conversion from intern to full timer (PPO).
Skills

Skills Tested

  • Problem Solving Abilties
  • Coding Skills And Knowledge On Data Structures
  • Database
  • Android Development
  • Computer Science
Read Full post...
8

Amazon Systems engineer interview

, 2.8k views
Anonymous2-3 yr work ex.Selected
Interview Process
Technical Interview Technical Interview Technical Interview
Round 1

Technical Interview

Interview Experience
They checked for the technical logic building capacity. They will ask questions related to LINUX.
Interview Tips
You should be very comfortable with linux advanced commands.
Round 2

Technical Interview

Interview Experience
They checked for the technical logic building capacity. They will ask questions related to LINUX.
Interview Tips
You should be very comfortable with linux advanced commands.
Round 3

Technical Interview

Interview Experience
They checked for the technical logic building capacity. They will ask questions related to LINUX.
Interview Tips
You should be very comfortable with linux advanced commands.
Round 4

Technical Interview

Skills

Skills Tested

  • Linux
  • Java Programming
  • Troubleshooting
Read Full post...
9

Amazon interview

, 53k views
LoFresherSelected
Application
I was interviewed on-campus at Anna University Chennai for role at Amazon
Interview Process
Test Other Interview Other Interview Hr cum technical Technical Interview
Round 1

Test

Test Sections
  • Section 1: Written Test
Interview Experience
    Two questions were asked in the written test. It was basically a coding round.
     1) 
                                                                         1
                                                                    /            \
                                                                 2                 3
                                                            /        \           /        \
                                                          4          5       6         7
                                   Output : 1,2 3,7,6,5,4
    2) Given a binary tree, check whether  a given sum ‘x’ is present along any path from the 
root to any of the leaves. 
              1
                                                                    /            \
                                                                 4                 3
                                                            /        \           /        \
                                                          9          5       6         7
                     if x = 14 , answer is true  because 1+4+9 = 14
                     if x =  12, answer is false
Round 2

Other Interview

Interview Experience
The initial interview was known to be Data Structures and algorithms round. The two 
interviewers totally asked me questions on data structures and mostly concentrated on how 
much I knew about time and space complexities.
a) The first question was to find the vertical column sum of every column in a given 
binary tree and return the result in an array from left to right.
The first solution which I told is by finding the leftmost and rightmost index of the array , 
thereby finding the index for the root. Following to this step, the sum can be stored easily while 
traversing from top to bottom and saving the value at index­1 while moving to the left and at 
index + 1 while moving to the left. This solution used two tree traversals. 
 He was good with this solution but asked to optimise with respect to time. Then, i 
shooted out the solution using a doubly linked list where we can traverse to and fro and store all 
the sum values. While using linked list, instead of index ­1 & index + 1 , prev and next pointers 
can be used to access the next and prev location from the current location. This way , the 
solution is optimized with time.
b) The second question was that I have been given a binary tree where the node 
structure would be something like below :
 struct tree
{
       struct tree * left, *right, *sib ;

Now , the task was to point every sib pointer to its nearest rightmost node in the same level. i.e 
the sib pointer of the rightmost node at every level would be NULL.
The first solution which I told them was to perform a Breadth first search and by using a 
queue would connect all the nodes of a level at a time. But, this would increase the space 
complexity and of course I was asked to optimize the solution.
       Given tree :
                                                                  root ­­­>  1
                                                                             /         \
                                                                         2               3
                                                                     /         \              \
                                                                    4       5                 7
     The result should be :
                                          root ­­­>  1
                                                                             /         \
                                                                         2   ­­­­­­>  3
                                                                     /         \              \
                                                                    4 ­­­­­> 5­­­­­­­­>7
  Let me explain the solution which I gave them for the above example. 
          Starting from 1, for any node connect the sib pointer of left node to its right node if both 
are present or if both are not null. If the left node is not present then no need to perform this 
operation but if the right node is alone present, then there may be another possibility for the 
presence of some other nodes at the same level. Here ,  2 will point to 3 as explained above. In 
the same way 4 will connect to 5 . But , we come to know that in the second  level there is one 
more node 3 and it has a child 7 . So , 5 is connected to 3’s right child. In the same way the 
other nodes would be connected. By this approach, we can understand that before pursuing 
towards any level, all the sib pointers in the previous level are connected. This solution would 
work for all the test cases. 
c) Given two arrays of integers , find the intersection of both arrays. I was asked to give 
various solutions and sort the solutions with respect to time complexitiy.
d) Given a binary search tree with positive integers and a number ‘X’ find the next 
greatest number to X from the BST. If the number is not present, return ­1.
Round 3

Other Interview

Interview Experience
 and code for it on paper. The two problems were based on data structures.
a) Given a binary tree, find the ancestor matrix where time complexity was considered 
but not much than the written code.
Given tree :
                                                                  root ­­­>  1
                                                                             /         \
                                                                         2               3
                                                                     /         \              \
                                                                    4       5                 6
The ancestor matrix is shown as 
     1   2   3   4   5   6  
1   0   1   1   1   1   1   
2   0   0   0   1   1   0
3   0   0   0   0   0   1
4   0   0   0   0   0   0
5   0   0   0   0   0   0
6   0   0   0   0   0   0
Let the above matrix would m[][]  such that m[i][j] = 1 , where i is the ancestor of j.
b) The second question was to swap every consecutive two nodes in a singly linked list.
         For example given a list 1­2­3­4­5­6­7­null
         The result must be      2­1­4­3­6­5­7­ null
For the above both questions , the interviewer saw the code and reviewed it with 
different test cases to get satisfied.                              
Round 4

Hr cum technical

Interview Experience
This was a HR cum technical round, but most of the questions were straight forward. 
The two managers who interviewed me were testing my managerial skillls. Lot of questions 
arised and the interview went for more than a hour. Few questions were like :
a) What do you know about Amazon ?
b) Why I preferred Amazon.com to my previous offer ?
c) The responsibilites which I undertook during my college days with brief explanations 
on every responsible task which I did !!
d) Any projects which I did apart from academics ?? I explained about my android 
project which I did with my elder brother.
At the end the round ended with a simple technical question =>
      I was asked to design a stack using a c++ class such that it can perform the following 
functions which will be called by different APIs :
            ­ Create a stack of size ‘n’
­ Push an element into the stack
­ Pop an element from the stack
­ Destroy the stack 
     At the end of this round, I asked about their experiences at Amazon.com and about my 
work/role at amazon in future.
Round 5

Technical Interview

Interview Experience
Coming to the fourth round, it was totally technical. Technical here covers theortical topic 
from the fields of Operating systems, OOPS and Networks. The questions which were asked 
were :
a) What is the difference between physical address and virtual address ?
b) What is page table and paging ?
c) What is the difference between thread and process ?
d) What is context switch and how it differs between process and threads ?
e) What are threads and why are threads preferred to process ?
f) What are semaphores and differnce between semaphores and locks ??
g) What are the 7 OSI layers in networks and their functionalities ?? He mostly asked 
about transport and network layers.
h) What is encapsulation ?
i) What is polymorphism and their types ??
j) What is differnce between polymorphism and function overloading ??
k) The last question was to design / implement a singleton class .
Here this round ended, but I made many sothapals without sufficient preparation :P
Interview No ­5
 This interview was also HR cum technical round but it was known as a bar raiser round. 
I am not sure how to spell it too. The questions were almost the same as in the 3rd interview 
with additional questions like  “ how did you react in conflicting situations in four year career ? “.
This round also ended with technical questions :
a) Given a doubly linked list where the next pointer is pointed to the next node in 
that list but the previous pointer is pointing to any random node. I was asked to make a 
similar list efficiently . [ Simply a xerox of it ]
b) The second question was a string based traversing and pattern matting type 
where there were given two strings ‘A’ and ‘B’. 
I was asked to return true if all the characters in ‘B’ were present in ‘A’ or else 
return false. I explain many solutions in which he asked me to code for a particular 
solution and he verified the code by iterating though the test cases. 
The round ended with few personal questions on experience and my future role. So, I was into 
Amazon after a week of discussions
Read Full post...
10

Amazon Decision scientist interview

, 3.4k views
ROSHIN JACOB JOHNSON Me12b166FresherSelected
Application
I was interviewed on-campus at IIT Madras for Decision scientist role at Amazon in Dec, 2016
Interview Process
Test Other Interview HR Interview Case Study Interview
Round 1

Test

Duration
45 Minutes
No. of Questions
28 questions
Interview Experience
Quant questions and basic programming
Round 2

Other Interview

Interview Questions
  • Question 1: Few simple puzzles and guestimates
Round 3

HR Interview

Interview Questions
  • Question 1: Most challenging problem you have solved or tried solving.
Round 4

Case Study Interview

Interview Experience
Simple question. Just keep on telling what comes to your mind.
Read Full post...
SignUp/Login
1-Step Login | Get unlimited access!
This is the alert