J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Amazon (Seattle, WA) en janv. 2011
Entretien
First phone interview, which didn't go well.
First question was about linked list traversal finding a node towards the tail. The algorithm I gave them ran in O(n), then they said it wasn't good enough, so I thought about reversing it and counting from the tail. That took up too much s...pace complexity so I was baffled for a while because I thought they wanted a much more efficient algorithm. Turns out they just wanted two pointers to traverse, which would only be faster than my original algorithm by a constant amount. I failed to see why that would make that much of a difference.
Second question was about Comparable vs Comparator. I NEVER used comparator during my years using Java so I couldn't answer that one.
Third question was finding duplicates in an array. Create another array to keep track of the repetitions, done.
Last question was the hardest - determining the angle between an hour hand and minute hand on a clock. I wasn't expecting a mathematical type question, plus I never really bothered to learn how an analog clock works that well anyway. I took a long time - and screwed up the formula for it, but basically it was dividing the degrees of each quadrant and applying what I know about hours and minutes to it. Didn't do that well - cause clocks aren't exactly my area of expertise.
Questions d'entretien [2]
Question 1
Find the angle between the hour hand and the minute hand on a clock given the hour, minute and second.
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.