Amazon Software Development Engineer interview questions
based on 3.4K ratings - Updated Jun 24, 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 2836 - 2840 of 3,377 Interviews
Amazon interviews FAQs
Candidates applying for Software Development Engineer roles take an average of 16 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 27 days.
Common stages of the interview process at Amazon as a Software Development Engineer according to 1 Glassdoor interviews include:
Phone interview: 50%
Skills test: 50%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 2 weeks. I interviewed at Amazon
Interview
Had three phone interviews. I was given some not very difficult programming assignments and asked few behavioral questions. Every time I was asked about time complexity for the code I wrote. Was also asked about projects described in my resume.
I applied online. The process took 6 weeks. I interviewed at Amazon (Seattle, WA) in Nov 2013
Interview
Applied for the Silk team via their website. Got a call within 2 weeks. There were a few clashes in the dates as my wife was going to deliver during that period, but they very kindly rescheduled.
I had 2 phone screens and was then called to Seattle for full-day interviews. Phone screen was done using collabedit tool, and on-site interview required writing code on white-board.
1st Phone screen: Write a power function. All edge cases like overflow, different values of powers (+ve, -ve, zero) need to be handled. Have to give most efficient solutions.
2nd Phone screen: Write a function that, given an array and a number as input, finds all pairs in the array that add up to that number. Number can be +ve/-ve. Write most space (or) time efficient algorithm. How will it handle duplicate pairs.
On-site interviews:
1. Given a 2D array (which has initially all false values), fill it up with 'X' true values placed randomly in it (like minesweeper game). Most efficient alog expected with handling of ALL edge cases.
2. Implement a simple contacts application in which one can search via First name. Most efficient alog expected with handling of ALL edge cases.
3. Bar-raiser: Given a log file from a website which contains the user ID and the accessed URL, find the TOP "sequence" of 3 urls amongst ALL visitors of the website. The sequence of urls have to be in sequence as they are accessed.
4. Experience related questions by Team manager over lunch.
5. Implement classes for a website that can be used for building your own computer. Eg: If a user selects a motherboard, it should filter out all the incompatible CPUs etc. You have to implement various classes that can be used for implementing this functionality.
Interview questions [1]
Question 1
Bar-raiser was difficult and unexpected (to me) as I'm from embedded application dev background and haven't dealt with such scenario's.
I applied through college or university. The process took 3 weeks. I interviewed at Amazon (Seattle, WA)
Interview
Talked to representative on career fair on campus, then took an online assessment (which contains 3 problems, 30 mins for each, mostly algorithm problems). About two weeks later got onsite interview opportunity in Seattle. Onsite interview has 4 rounds, 45 mins each, including algorithm, data structure and design problems.