Software Development Engineer (SDE) applicants have rated the interview process at Amazon with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 59% positive. To compare, the company-average is 57.5% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Development Engineer (SDE) roles take an average of 47 days to get hired, when considering 764 user submitted interviews for this role. To compare, the hiring process at Amazon overall takes an average of 28 days.
Common stages of the interview process at Amazon as a Software Development Engineer (SDE) according to 764 Glassdoor interviews include:
Skills test: 22%
One on one interview: 22%
Phone interview: 19%
Personality test: 11%
Presentation: 7%
Background check: 6%
Group panel interview: 5%
IQ intelligence test: 4%
Other: 3%
Drug test: 1%
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at Amazon in Sep 2021
Interview
There were two rounds of technical interviews followed by another two hiring manager rounds. Questions had a mix of coding and behavioral questions. The difficulty level of coding questions was moderate.
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.
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?