Software Developer applicants have rated the interview process at Amazon with 3.5 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 33% positive. To compare, the company-average is 63.8% positive. This is according to Glassdoor user ratings.
Here are the most commonly searched roles for interview reports -
The process consisted of an initial online assessment with coding challenges on data structures and algorithms, followed by a technical interview. During the technical round, I was asked to solve problems in real-time while explaining my thought process. What was a bit disheartening is the interviewer not indulging in the interview process. They gave a question and muted their mic and were not responding.
Interview questions [1]
Question 1
You are given a tree with n nodes and n-1 edges. Each node has a price associated with it. The tree can be rooted at any node, and the "cost" of a root is defined as the difference between the highest and lowest price sums of all paths starting from that root.
Given the tree structure and the price array, return the maximum possible cost across all possible root choices.
1 coding round with 3 questions
2 are easy 3 rd one is complicated related to binary trees. And one is related to disk space allocation. They re bit complicated bit easy to solve
Interview questions [1]
Question 1
Asked to write code to love a problem or was easy but he asked for time complexity and asked to optimise it to O1 which looked impossible
I applied through a recruiter. I interviewed at Amazon (Berlín)
Interview
The first part was the Amazon Leadership Principles question. Then, there was a Leetcode Medium question. First, I solved the question in suboptimal way and we discussed the time and space complexity. The interviewer was helpful and kept giving hints to solve the issue optimally.
Interview questions [2]
Question 1
The LP question was something like: tell about the situation, when you had to deal with very time-constraint project/task.
Design a data structure that tracks visitors in a queue with the following requirements:
- Possibility to return the last person in the queue, who visited only once
- All operations must be O(1) time complexity
visit("Alice") -> Queue: [Alice]
visit("Bob") -> Queue: [Alice, Bob]
visit("Charlie") -> Queue: [Alice, Bob, Charlie]
visit("Bob") -> Queue: [Alice, Charlie] (Bob removed because second visit)
get_last_unique() -> Returns "Charlie"
visit("David") -> Queue: [Alice, Charlie, David]
visit("Charlie") -> Queue: [Alice, David] (Charlie removed because second visit)
get_last_unique() -> Returns "David"