Amazon Software Development Engineer SDE I interview questions
based on 1.5K ratings - Updated Jul 5, 2026
Averageinterview difficulty
Very positiveinterview experience
How others got an interview
60%
Applied online
Applied online
19%
Campus Recruiting
Campus Recruiting
10%
Recruiter
Recruiter
8%
Employee Referral
Employee Referral
2%
Other
Other
1%
In Person
In Person
0%
Staffing Agency
Staffing Agency
Interview search
1,536 interviews
Viewing 936 - 940 of 1,536 Interviews
Amazon interviews FAQs
Software Development Engineer SDE I applicants have rated the interview process at Amazon with 3.2 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 50% positive. To compare, the company-average is 58.2% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Development Engineer SDE I roles take an average of 10 days to get hired, when considering 6 user submitted interviews for this role. To compare, the hiring process at Amazon overall takes an average of 31 days.
Common stages of the interview process at Amazon as a Software Development Engineer SDE I according to 6 Glassdoor interviews include:
Phone interview: 40%
IQ intelligence test: 20%
One on one interview: 20%
Presentation: 20%
Here are the most commonly searched roles for interview reports -
Interview was somewhat average. The interviewer was friendly and he started by introducing himself and asked me to tell me about myself. I was asked to solve two coding questions which I solved.
I applied online. I interviewed at Amazon in Jan 2023
Interview
Applied without referral from Handshake job posting Got OA with 2 medium difficulty level questions , had to finish in 105 minutes. First question was less time taking but second one took most of the time. Somehow managed to pass all the test cases for both the questions. Waiting for the response after submitting it.
Interview questions [1]
Question 1
Q1: Fleet of wheels Q2: pair nearest to target integer
Breadth First Search or BFS for a Graph. The breadth-first search (BFS) algorithm is used to search a tree or graph data structure for a node that meets a set of criteria.