Software Development Engineer (SDE) applicants have rated the interview process at Amazon with 3.8 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 50% positive. To compare, the company-average is 59.7% positive. This is according to Glassdoor user ratings.
Common stages of the interview process at Amazon as a Software Development Engineer (SDE) according to 4 Glassdoor interviews include:
Personality test: 33%
One on one interview: 33%
Skills test: 33%
Here are the most commonly searched roles for interview reports -
4 rounds of LC hard. Most of them were in Leetcode. In every interview, the first 10 mins are for leadership principles followed by the Leetcode question. I got questions from 4 leadership principles which were usually found online.
Interview questions [1]
Question 1
4 rounds of LC hard. Most of them were in Leetcode. In every interview, the first 10 mins are for leadership principles followed by the Leetcode question.
The loop consists of 4–5 back-to-back interviews, each lasting 45–60 minutes. Your panel will typically include your potential hiring manager, 1–2 team members, a senior leader, and the Bar Raiser. Every interviewer is assigned 2–3 specific Leadership Principles to evaluate. Together, the panel covers all 16 principles across the loop.
Interview mainly consisted of DSA and questions on Leadership Principles.
Also slightly emphasizing on Low level design.Interview sort of helped me with the approach and asked me to explain the time and space complexity
I applied through a recruiter. I interviewed at Amazon
Interview
The interview process started with an initial recruiter screening, followed by technical interview rounds. The technical interviews focused on data structures, algorithms, problem-solving, and discussing my approach clearly. The interviewers also asked behavioral questions related to teamwork, challenges, and past projects. Overall, the process was structured and professional.
Interview questions [1]
Question 1
Given a binary tree, how would you find the lowest common ancestor of two nodes if each node also has a parent pointer?