Software Development Engineer (SDE) Intern applicants have rated the interview process at Amazon with 3.1 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 78% positive. To compare, the company-average is 55.1% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Development Engineer (SDE) Intern roles take an average of 56 days to get hired, when considering 9 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) Intern according to 9 Glassdoor interviews include:
Personality test: 22%
Phone interview: 22%
Drug test: 11%
One on one interview: 11%
Group panel interview: 11%
Skills test: 11%
Presentation: 11%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 3 weeks. I interviewed at Amazon (Seattle, WA) in Jun 2022
Interview
behavior questions, LinkedList, and an array problem. LinkedList problem: how to delete a particular node without access to the head. Behavior question: Tell a story of a tight deadline. I forgot about the array problem but I think it should be a medium question
Standard LC mediums, nothing too crazy. Interviewer was pretty chill and was helpful in pointing me in the right direction when I needed as well. Only thing I would probably change was to study more on graph problems before hand.
Interview questions [1]
Question 1
You are given an 0-indexed integer array weights, where weights[i] represents the weight of the i-th marble, and an integer k.
Your task is to divide the marbles into k bags such that:
No bag is empty.
Each bag must contain marbles from a contiguous range of indices. That is, if a bag includes marbles at indices i and j, then all marbles with indices between i and j (inclusive) must also be included in that same bag.
The cost of a bag that includes marbles from index i to j (inclusive) is defined as weights[i] + weights[j].
The total score of a distribution is the sum of the costs of all k bags.
Return the difference between the maximum and minimum possible scores among all valid distributions.
Applied online and received an Online Assessment. It consisted of two LeetCode-style coding problems with a time limit . The process was straightforward and fully automated with no human interaction at this stage.
Interview questions [1]
Question 1
Solve a coding problem involving array manipulation under a timed online assessment
There were 2 rounds- one DSA round and one HR round.
In the first round they asked me a DP + trees question which was of medium to hard difficulty.
In the second round the interviewer asked me about my resume, my projects, some computer fundamental questions.