Amazon Software Engineer Swe II interview questions
based on 43 ratings - Updated May 28, 2026
Averageinterview difficulty
Mostly positiveinterview experience
How others got an interview
56%
Applied online
Applied online
22%
Recruiter
Recruiter
11%
Campus Recruiting
Campus Recruiting
6%
Other
Other
6%
Employee Referral
Employee Referral
Interview search
43 interviews
Viewing 6 - 10 of 43 Interviews
Amazon interviews FAQs
Software Engineer Swe II applicants have rated the interview process at Amazon with 4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 50% positive. To compare, the company-average is 58.6% positive. This is according to Glassdoor user ratings.
Common stages of the interview process at Amazon as a Software Engineer Swe II according to 2 Glassdoor interviews include:
Phone interview: 50%
Skills test: 50%
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at Amazon (Sunnyvale, CA)
Interview
Two technical interviews leetcode medium and hard. There was a behavioral portion where they looked at alignment with Amazon values which was at the beginning and also touched on throughout process.
Interview questions [1]
Question 1
Implement a dfs search on a path tree to find the optimal directory change path to get to a target file.
In the beginning there is one fit interview with a hiring manager, followed by 5 onsite interviews, and then they give you an offer if all of these are passed.
Interview questions [1]
Question 1
They asked standard leetcode questions (data structures and algorithms focused).
The interview process assesses candidate proficiency in algorithmic problem-solving and scalable System Design. Expect LeetCode-style questions covering fundamental algorithms and data structures, including graph traversal like DFS and BFS, array manipulation using Two Pointers, and recursive problem decomposition (Recursion). Focus on efficiency and complexity analysis.
Interview questions [1]
Question 1
Given an $m \times n$ binary matrix representing a map of 'land' ($1$) and 'water' ($0$), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically.