# Amazon placement papers for testing profile

#Amazon_placement_papers for testing profile !

Interview process :-
• 1. GD
• 2. Online / written test
• 3. Technical
• 4. HR !

http://www.crackmnc.com/p/amazon-placement-paper.html

========== Candidate 1 experience ========
**********Amazon Device Associate********

I want to share my interview experience at Amazon today for the position of Device Associate.
I didn’t receive any call letter though I applied for it but I asked my friend to send me the call letter and faked it and went to attend the drive, I was very nervous because this was my first time where I faked the call letter and when I reached there my heartbeat was very fast I thought they will come to know that I have a fake call letter and will send me back but honestly nothing like that happened and I gave
first round written which consist of 40 questions ( reasoning + logical + verbal ) and cleared that

============= Candidate 2 experience============

1. GD round :- You know how you need to prepare/ how you need to perform in GD right ? its kind of "extempore" round ! so communicate well !

2. Online / written test ;-
Aptitude and reasoning 20 questions ... topics are basic permutation combination, probability ,C questions
Amazon on line coding questions 2 print the left view of a binary trees .Que will be like :-
> . Search for a value in a given BST.
> Return the number of distinct pair of elements in a given array that add up to a given number.
After on line exam amazons placement procedure next section

3. Technical Round :-
#Amazon Face to Face interview technical interview :-
In this section questions related to binary tree with nodes having garbage values is given and an array is given..
A skeleton of a binary tree with nodes having garbage values is given and an array is given. Had to fill up the binary tree skeleton with the values in array such that the resulting tree is a BST.
Solution: sort the array, enter the values in an in-order fashion (A long discussion on which sorting algorithm is the best and why? We ended up discussing how merge sort can be optimized, just �optimized�, not like reducing the order of time or space complexity). Then told me to write the merge-sort function for the discussed solution for merge-sort such that say I am a developer, I can�t test on a machine, and this class will be used by a million number of users.