J'ai postulé via un recruteur. Le processus a pris 2 jours. J'ai passé un entretien chez Amazon en mai 2011
Entretien
Asked some general questions like describe your most challenging project, Explain REST vs SOAP.
Gave some whiteboard questions like given two strings, write a function that returns the index of the first match of one string within the other.
And Given a set of x elements connected in a circular fashion, remove every nth element until the last one remains.
I solved both but the interviewer didn't like my first solution. Had to convince him to compile and run it to test before he accepted the next day it as correct. Guess we didn't mesh well.
Questions d'entretien [1]
Question 1
Given two strings, write a function that returns the index of the first match of one string within the other
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.