Amazon Software Development Engineer interview questions
Updated Jun 3, 2026
based on 3.4K ratings
Difficulty
Average
Experience
Very positive
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,374 interviews
Viewing 26 - 30 of 3,374 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 -
Interview went well with four rounds completed. However, since I took the interview three years ago, I don’t believe that experience will be particularly useful or relevant now now now
Online Assessment followed by 3 virtual technical interviews (45 minutes each), where you are asked to complete leetcode style coding questions. Ranging from medium to hard difficulty, maybe some OOP / design questions as well. 1 behavioural question in each interview.
Interview questions [1]
Question 1
What are some past challenges you faced and how did you respond
I applied through an employee referral. I interviewed at Amazon in Oct 2025
Interview
Applied through referral. I immediately got an invite to take an online assessment.
You have a week to take the test including three parts:
Coding challenge (2 HackerRank questions, 90min)
System design - rating the effectiveness of potential actions (~15min, not timed)
work style - choose the extent to which a statement represents your work style (~10min, not timed)
The coding questions were horribly long to read.
Interview questions [2]
Question 1
You are given sum and n. You need to return the smallest lexicography permutation, that includes 1 to n, where each can be plus/minus, and their sum is equal to sum.
The permutation needs to be lexicography sorted as well.
For example: n=5, sum=9.
Permutations: [-1,-2,3,4,5], [1,2,-3,4,5]..
Each sorted: [-2,-1,3,4,5], [-3,1,2,4,5]..
Then return the smallest lexi out of all: [-3,1,2,4,5]
You are given locations array, which are (x,y) on a graph, that represent servers.
And directions array, which are values 1-4, that represent the directions a request is routed. When 1 is (x,y)->(x+Z,y+Z), 2 is (x,y)->(x+Z,y-Z), 3 is (x,y)->(x-Z,y+Z) and 4 is (x,y)->(x-Z,y-Z).
You need to start from locations[0], and route the request by following the direction steps.
In each step, you need to route the request to the closest unvisited server. If there is no such, skip to the next step.
Return the location at the end.