Software Development Engineer (SDE) applicants have rated the interview process at Amazon with 3.7 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 63.4% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Development Engineer (SDE) roles take an average of 49 days to get hired, when considering 9 user submitted interviews for this role. To compare, the hiring process at Amazon overall takes an average of 38 days.
Common stages of the interview process at Amazon as a Software Development Engineer (SDE) according to 9 Glassdoor interviews include:
Skills test: 33%
Phone interview: 27%
Personality test: 20%
Presentation: 7%
One on one interview: 7%
Background check: 7%
Here are the most commonly searched roles for interview reports -
They sent an OA after about a few weeks of applying with a referral, and then after passing it the sent a final round interview, after that a few weeks with offer
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?