J'ai postulé via la recommandation d'un employé. Le processus a pris 2 semaines. J'ai passé un entretien chez Amazon (Bengaluru) en févr. 2012
Entretien
Round1 : Telephonic Interview
1) Given a Binary Search Tree, Find out the distance between two Given Nodes
2) Solve the previous problem for Binary Tree
Round2 : Written Test
1) Given a Binary Tree, set sibling pointer for each node. (Assume that sibling pointer exists in the node)
2) Given a Binary Tree and a number n, check whether there exists a path from root to some leaf such that sum of all values in that nodes it path equals n.
3) Given a array of characters of this replace the characters which occur continously with the character and no. of times it occured e.g. AAAABCCDDD A4BC3D3 (count for characters that occurs once can be ignored)
Round3: Technical Interview
1) Given a Binary Tree, Find out the all vertical sums from root to all leaves.
2) In a Binary Tree, Each node has an additional pointer which points to either NULL or inorder successor of that node or garbage pointer. Write a function to set all the garbage pointers to NULL.
Round4: Technical Interview
1) Given two prime numbers n1, n2 find out the minimum no. of operations required to change n1 to n2. The only allowed operation is we can change 1 digit can be interchanged with an additional constraint that the intermediate no. must also be prime.
Round5: Technical Interview
1) Simple questions regarding Operating systems
Round6: Telephonic Interview
1) Give an O(n) solution for Maximum Subarray problem?
2) An unbounded byte array contains characters. Each character is 1 or 2 byte long. There are no delimiters between characters. The MSB of 1-byte character would be 0. The MSB of left byte of 2 byte characater would be 1 and MSB of right byte (second) can be either 0 or 1
8
Autres retours d’entretien d’embauche pour un poste comme Software Development Engineer chez Amazon
Surprisingly easy — I expected tougher questions, but the coding round felt more like a warm-up. The main challenge was a DSA problem about counting islands in a 2D grid, which led to a discussion on DFS versus BFS and handling large grids. Funny enough, I had revisited that exact type of question while prepping on PracHub, which made me feel more confident. The interview wrapped up with a behavioral round, and I accepted an offer, but ultimately decided to decline it for another opportunity. Overall, it was a smooth experience.
Questions d'entretien [1]
Question 1
Number of Islands — given a 2D grid of '1's (land) and '0's (water), count the number of connected islands. Walk through DFS vs BFS, and discuss how to avoid revisiting cells (in-place mutation vs visited set) and what changes if the grid is huge and must stream from disk.
It started with an OA, and then after a few weeks, I got invited to four rounds of interviews: technical and behavioral at 3 of the 4, and behavioral only at one.
Um teste de código online, se aprovado, vai para o loop. O loop é 4 entrevistas seguidas, duas em inglês e duas em português. 3 entrevistas técnicas de código, todas as 4 têm pergunta de liderança.
Questions d'entretien [1]
Question 1
Pergunta historicas baseada nos principios de lideranca da amazon.
