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 68% positive. To compare, the company-average is 57.5% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Development Engineer (SDE) Intern roles take an average of 52 days to get hired, when considering 282 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 Software Development Engineer (SDE) Intern according to 282 Glassdoor interviews include:
One on one interview: 26%
Skills test: 21%
Phone interview: 14%
Presentation: 12%
Personality test: 9%
IQ intelligence test: 7%
Background check: 4%
Drug test: 3%
Other: 2%
Group panel interview: 1%
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at Amazon in Feb 2021
Interview
OA 1: Very easy debugging questions. You get 7 questions in 21 minutes. Totally doable.
OA 2: Two LeetCode Medium questions
OA3: The most interesting round. You have a virtual workspace and you respond to the emails and chats.
Interview: Two Behavioral Questions and an Easy LeetCode Question. The interviewer just stuck to this question and kept on asking me to optimize the solution in the whole interview. Pay special emphasis to runtimes of the solution.
Tip: Even if you know what method you have to apply but do not know how to implement it, just talk to the interviewer about it and tell them why are you implementing that idea. They care about ideas, not solutions.
Interview questions [1]
Question 1
Return the triplets that sum up to the target value.
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.