Software Engineer applicants have rated the interview process at Amazon with 3.5 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 33% positive. To compare, the company-average is 63.8% positive. This is according to Glassdoor user ratings.
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at Amazon (Seattle, WA) in Feb 2025
Interview
The OA consists of multiple parts. One was brain teasers and the other was a virtual day simulator where they walked you through various scenarios and offered you decisions to make.
Interview questions [1]
Question 1
Given this data set, which delivery route is optimal?
I applied online. I interviewed at Amazon (Mumbai) in Apr 2024
Interview
Amazon’s interview process begins with resume screening, followed by a recruiter phone screen to assess your background and alignment with Amazon’s Leadership Principles. Next is a technical or functional phone interview, often involving coding or role-specific questions. The final stage is the onsite “Loop,” a series of 4–6 interviews covering behavioral and technical competencies. One interviewer is a Bar Raiser who ensures high hiring standards. After the interviews, a hiring committee reviews all feedback to make a decision. If successful, you’ll receive an offer and can negotiate. Preparation should focus heavily on Amazon’s 16 Leadership Principles and core job skills.
Interview questions [1]
Question 1
Tell me about yourself? why you want to join this company?
expallain me the role?
The process consisted of an initial online assessment with coding challenges on data structures and algorithms, followed by a technical interview. During the technical round, I was asked to solve problems in real-time while explaining my thought process. What was a bit disheartening is the interviewer not indulging in the interview process. They gave a question and muted their mic and were not responding.
Interview questions [1]
Question 1
You are given a tree with n nodes and n-1 edges. Each node has a price associated with it. The tree can be rooted at any node, and the "cost" of a root is defined as the difference between the highest and lowest price sums of all paths starting from that root.
Given the tree structure and the price array, return the maximum possible cost across all possible root choices.