Amazon Software Development Engineer(SDE) Intern interview questions
based on 443 ratings - Updated Jun 7, 2026
Averageinterview difficulty
Very positiveinterview experience
How others got an interview
68%
Applied online
Applied online
22%
Campus Recruiting
Campus Recruiting
8%
Employee Referral
Employee Referral
1%
Recruiter
Recruiter
1%
Other
Other
Interview search
443 interviews
Viewing 41 - 45 of 443 Interviews
Amazon interviews FAQs
Software Development Engineer(SDE) Intern applicants have rated the interview process at Amazon with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 58.7% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Development Engineer(SDE) Intern roles take an average of 150 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 29 days.
Common stages of the interview process at Amazon as a Software Development Engineer(SDE) Intern according to 1 Glassdoor interviews include:
Personality test: 33%
Skills test: 33%
Phone interview: 33%
Here are the most commonly searched roles for interview reports -
The whole interview was around an hour - 30 minutes behavioral then 30 minutes technical. There are lots of videos on YouTube about Amazon behavioral, the technical was about trees and graphs. Interviewer was very helpful.
Interview questions [1]
Question 1
Explain a conflict you had to solve within a group.
I applied through college or university. The process took 2 days. I interviewed at Amazon (Dhanbād) in May 2025
Interview
Oncampus:
The process started with an online assessment that included two coding problems and some MCQs on behavior. After shortlisting, there was only one interview round: one technical. The technical round focused on data structures and algorithms, with emphasis on problem-solving, coding efficiency, and explaining the approach clearly.
Interview questions [1]
Question 1
They asked me to solve a problem on finding the longest substring without repeating characters. I explained my approach using a sliding window technique, optimized it to O(n), and implemented it in C++.