Amazon Software Development Engineer interview questions
based on 3.4K ratings - Updated Jun 28, 2026
Averageinterview difficulty
Very positiveinterview experience
How others got an interview
48%
Applied online
Applied online
20%
Campus Recruiting
Campus Recruiting
18%
Recruiter
Recruiter
11%
Employee Referral
Employee Referral
1%
Other
Other
1%
In Person
In Person
1%
Staffing Agency
Staffing Agency
Interview search
3,377 interviews
Viewing 3276 - 3280 of 3,377 Interviews
Amazon interviews FAQs
Candidates applying for Software Development Engineer roles take an average of 21 days to get hired, when considering 2 user submitted interviews for this role. To compare, the hiring process at Amazon overall takes an average of 42 days.
Here are the most commonly searched roles for interview reports -
I applied through a staffing agency. The process took 2 weeks. I interviewed at Amazon in Aug 2010
Interview
2 phone screens and 6 hr site interview. Basic areas of they test your skills are 1) Data structures and algorithms 2) objective-oriented design 3) linux/shell knowledge, Regex 4) designing large systems and scaling. Language is not really important but they expect you to know at least one of C++, Java or Ruby.
Interview questions [1]
Question 1
1) Write a prime number service in language of your choice. how you scale it. 2) design an airline company in object-oriented way.
I applied online. The process took 2 weeks. I interviewed at Amazon in Nov 2010
Interview
Applied for a Software Development Engineer online. Got an email after some days from the recruiter asking some things such as:
-Why do I want to work for the company
-What is my preferred programming language
-Implement function to check palindrome.
A few days after I responded we arranged a phone interview for which I didn't have time to prepare as much as I would like. Some of the questions were the same as found here, others not. It lasted about 1h 20 mins.
The interviewer was very helpful, nice and overall pleasant.
Interview questions [1]
Question 1
Given an array of numbers find maximum subset sum? What is the complexity.