J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Amazon (Seattle, WA)
Entretien
2 Rounds of interview. Both telephonic.
Round1:
(Q1) Asked to write code to merge 2 sorted arrays.Walk through an example.
(Q2) Asked to reverse a linked list witout using external memory. Wrote code using 3 pointers. He asked me to walk through an example.
Round2:
(Q1) Asked about OOP concepts with a real world example for each principle.
(Q2) Asked about merge sort vs Quick sort / time complexities /when to use which.
(Q3) Asked me write code about to check whether tree is symmetric.
Questions d'entretien [1]
Question 1
Was confused abit about TREE SYMMETRIC question. He was expecting a recursive solution. But explained him a solution using tree inorder/preorder/postorder traversals. Explained him, and wrote code for different traversals and some functions to integrate all.
Finally he seems convincing with my approach and solution.
