Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Amazon em jul. de 2016
Entrevista
Amazon came to our campus for recruitment this July.
First round was online test for about 1hr. The questions were damn easy. It was like cake walk.
Second round, we had paper coding. Questions were asked from data structures.
Then we had 2 Technical face-to-face interview and 1 HR round.
Perguntas de entrevista [1]
Pergunta 1
Second round, paper coding questions were...
1. Find the common leaf node that is common for two binary tree.
2. Given a 2D array of 1's and 0's convert all the cells of row and column into 1's whose particular cell is 1.
Technical round:
Optimize the solution provided in the second round.
Questions from almost all data structures like stack, queues, trees, trie, sorting, searching etc,
Interviewed for silicon team. Have only been asked about the domain specific knowledge in 1st round and system design in 2nd round and C coding in 3rd round.
The interviews were 50 mins each.
Fiz uma entrevista na empresa Amazon (Toronto, ON).
Entrevista
First round with hr screening - 2 leetcode questions then hr manager screening then the loop which consists of 4 interviews each an hour long. The 4 interview questions they asked where three medium leetcode questions. And one system design interview question about how to shadow deploy a test software to millions of users.
The phone screen went longer than expected, focusing heavily on implementation details. The interviewer really grilled me on my approach to a Least Recently Used (LRU) cache, asking how I'd combine a hashmap with a doubly linked list. I felt well-prepared since I had gone through system design examples on PracHub, which made me comfortable discussing eviction policies. The later rounds included more technical questions and behavioral interviews, but in the end, I received an offer, though I ultimately decided to decline. Overall, I’d say the process was average, with solid questions.
Perguntas de entrevista [1]
Pergunta 1
Design and implement a Least Recently Used (LRU) cache supporting get(key) and put(key, value) in O(1) average time. Walk through combining a hashmap with a doubly linked list, eviction policy when capacity is exceeded, and how you'd extend it to handle thread-safe concurrent access.