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:
Phone interview: 22%
Personality test: 22%
Group panel interview: 11%
Drug test: 11%
One on one interview: 11%
Skills test: 11%
Presentation: 11%
Here are the most commonly searched roles for interview reports -
I applied through university. The process took 1 week. I interviewed at Amazon (Hyderābād) in Dec 2023
Interview
The interviewer tgave his introduction and then I gave my introduction. Aftr that the technical round began. I was asked two DSA questions and was asked to code the solution, explain dry run of the code and write the time and space complexity of the solutions.
Interview questions [1]
Question 1
Q1. Given a list of 0's, 1's and 2's, sort the list in place and return it.
Q2. Given a list of strings, generate all the anagrams of each string, put it into a list and put that list in another list. The anagrams should be in order of the appearance of the strings and duplicates should be removed(eg. cat and tac will have same anagrams so we should only return it once)
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.