Entry Level Software Engineer applicants have rated the interview process at Amazon with 3.7 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 55% positive. To compare, the company-average is 57.5% positive. This is according to Glassdoor user ratings.
Candidates applying for Entry Level Software Engineer roles take an average of 69 days to get hired, when considering 12 user submitted interviews for this role. To compare, the hiring process at Amazon overall takes an average of 28 days.
Common stages of the interview process at Amazon as a Entry Level Software Engineer according to 12 Glassdoor interviews include:
One on one interview: 29%
Presentation: 21%
Skills test: 14%
Phone interview: 14%
Drug test: 7%
Group panel interview: 7%
IQ intelligence test: 7%
Here are the most commonly searched roles for interview reports -
I had 3 45 min interviews with software engineers over video calls. One of them asked me to code but the rest asked about my experience working wiht peers and overcoming problems
Interview questions [1]
Question 1
One of the engineers asked what data structure I would use to search and allocate memory of a given size
I applied online. The process took 1 week. I interviewed at Amazon (Guadalajara, Jalisco) in Oct 2025
Interview
Coding interview; one medium to hard leetcode-style question + one technical/design real-world question where the goal is to create a robust solution with good practices, it isn't focused on efficiency.
The first level of the hiring process is a online assessment which includes two questions of hard liquid style questions and a survey I felt that the questions were very hard I only started answering one question I had 45 minutes for the question was a question regarding lists and two away lists and x finding a number of elements within a list and giving back the biggest ones of the list
Interview questions [1]
Question 1
Given a 2d list and a list and a x example to the list contains three lists of size 3 list contains three elements and x is 2 list and index one is one so give back the biggest one element from to the list and the next one index 2 is 2 so give me back two of the biggest in the to the array and so forth and then if x is 2 so give me the sum of two biggest nuns if cannot be done return minus one