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 131 - 135 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 online. The process took 6 months. I interviewed at Amazon
Interview
Application Date: May 2024
This is the date when I submitted my application for the position.
- Assessment Period: November 2024
During this time, I will undergo evaluations to assess my qualifications and fit for the role.
- Final Interview Round: February 2025
This is the last stage of the interview process, where I will meet with key decision-makers to discuss my candidacy in detail.
Interview questions [1]
Question 1
2 Rounds LeetCode (2 Easy, 3 Hard) Questions.
1 Round LP - (Not at all Good experience, Interviewer was so rude only took my interview for 15 mins, due to connection issue )
I applied through a recruiter. The process took 2 months. I interviewed at Amazon (Bengaluru) in Aug 2022
Interview
Good. A few rounds of DSA. It went well. DSA wasn't too difficult but graphs, sets etc were there. The team was nice and fun loving. We worked a lot, we made good money.
The OA is quite difficult. I need to resolve a question with sliding window and consider tons of edge cases. And the time is limited. I need to finish two questions in 75 minutes and it is not easy.
Interview questions [1]
Question 1
Given an integer array, representing distances from 0, and a number, representing the number of points a sneak should visit, a sneak starts from distance zero, write the algorithm to return the minimal distances the sneak should use after visiting given number of points.