Amazon Software Development Engineer, II interview questions
based on 293 ratings - Updated May 9, 2026
Averageinterview difficulty
Mostly positiveinterview experience
How others got an interview
47%
Recruiter
Recruiter
30%
Applied online
Applied online
11%
Employee Referral
Employee Referral
7%
Staffing Agency
Staffing Agency
2%
Other
Other
2%
In Person
In Person
2%
Campus Recruiting
Campus Recruiting
Interview search
293 interviews
Viewing 271 - 275 of 293 Interviews
Amazon interviews FAQs
Candidates applying for Software Development Engineer, II roles take an average of 42 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Amazon overall takes an average of 37 days.
Common stages of the interview process at Amazon as a Software Development Engineer, II according to 1 Glassdoor interviews include:
Personality test: 50%
Phone interview: 50%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 5 weeks. I interviewed at Amazon (Chennai) in Mar 2013
Interview
First round will be telephonic, where they ask you to write a ready-to-deliver to production standard code and email them. Followed by three rounds of technical interview involving problem solving, data structures, algorithms and design. If you clear above all rounds, you will be taken into Hiring manager round and cultural fit round. These two rounds are bar raiser rounds. In bar raiser round they will ask questions based on your performance on first three rounds. On completing all these rounds, they will has meeting of all the interviewers whoever interviewed you. That meeting decides whether you will be hired or not.
I applied through a staffing agency. The process took 1 day. I interviewed at Amazon (Bengaluru) in Jan 2013
Interview
Written Test (3 coding questions)
Four rounds of Interview
Coding questions in Written test:
1) In an array of integers, find pair of integers whose sum is equal to closest to K
2) getIntegerComplement() function implement
3) Subroot in a Binary tree with longest leaf-to-leaf path
Interview questions [1]
Question 1
Subroot in a Binary tree with longest leaf-to-leaf path