J'ai postulé via la recommandation d'un employé. Le processus a pris 1 jour. J'ai passé un entretien chez Amazon (Chennai) en mars 2012
Entretien
Questions asked
Written round
1….Convert floating number to String
Ex float value 17.53 to string value 17.53
2….N ary searching in a tree
3…Finding the index of rotation in a rotated sorted array ..
1 2 3 4 5 6 is a sorted array and rotated sorted array is 3 4 5 6 1 2 .. Here the index of rotation happens at 5 position … Order of this pgm should be in o(n/2)
My first round was testing which u guys won have as u all apply for SDE ..
Questions d'entretien [1]
Question 1
Questions asked
Written round
1….Convert floating number to String
Ex float value 17.53 to string value 17.53
2….N ary searching in a tree
3…Finding the index of rotation in a rotated sorted array ..
1 2 3 4 5 6 is a sorted array and rotated sorted array is 3 4 5 6 1 2 .. Here the index of rotation happens at 5 position … Order of this pgm should be in o(n/2)
My first round was testing which u guys won have as u all apply for SDE ..
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.
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.
Questions d'entretien [1]
Question 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.