My Amazon SDE-1 interview Experience - Rejected after Bar Raiser
Question Details
I wanted to share my interview experience for the SDE-1 role at Amazon. The whole process had 5 rounds including the OA. OA Round I gave the OA around late October. It had 2 LeetCode medium questions.
Full Details
I wanted to share my interview experience for the SDE-1 role at Amazon. The whole process had 5 rounds including the OA. OA Round I gave the OA around late October. It had 2 LeetCode medium questions. One was a sliding window problem. The other was based on number theory. If you were comfortable with prime numbers and sieve concepts, it was manageable. After solving the coding questions, there was also a 30-minute behavioral round in the OA. I didn’t hear anything for a while, but around late December I received an email saying they would like to move forward with interviews. Round 1 (Technical) They scheduled two technical rounds on the same day. In the first round, I was asked two DSA questions. Question 1: Course Schedule The interviewer asked me to implement both approaches: DFS (cycle detection) Kahn’s algorithm Then he asked a follow-up about reducing space complexity, since the goal was only to determine whether scheduling the courses is possible. Question 2: This was an interesting problem. You are given an array of prime numbers, and you generate a sequence using combinations of these primes.
Example: If primes = [2,3,5], the sequence becomes: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12... The task was to find the nth number in this sequence. Initially it looked confusing, but after examining the test cases I realized it could be solved using a priority queue (min heap) approach. Once I got the idea, implementation was straightforward. I finished both questions in around 35 minutes. After that we discussed: my previous work some Leadership Principle questions what Amazon is currently working on Overall the round went very well. Round 2 (Technical) After a one hour break, I joined the second round feeling quite confident. The interviewer said he would ask two DSA questions. Question 1 You are given an array. Find the subarray whose (minimum + maximum) sum is maximum.
Example:
Input: [9,4,2,3,8,7] Answer: 15 Subarray: [8,7] All elements ai > 0. It turned out to be a greedy-style reasoning problem, and after dry running a few cases I figured it out. Then he asked a follow-up question What if we also want to return the maximum length subarray that achieves the same value? We discussed that variation briefly. Question 2 Distribute Coins in Binary Tree Luckily I had solved this problem before, so implementing it was straightforward. The round ended with a few more Leadership Principle questions. Round 3 (Technical + Discussion) The next week I had the third round. The interviewer introduced himself and explained the team and the type of work they do. He mentioned the round would include: one coding problem some discussion about Gen-AI The coding question was this one: https://carloarg02.medium.com/my-favorite-coding-question-to-give-candidates-17ea4758880c At first it looked simple, but the implementation was tricky. It took me around 30 minutes to arrive at a working solution. After that he asked whether I had worked on Gen-AI. I haven’t primarily worked in Gen-AI, but I explained some related experience and projects. Then we discussed my past projects and the round concluded. About one hour later, HR called and said I had cleared the round, and my Bar Raiser round would be scheduled the following week. Bar Raiser Round (Final) The Bar Raiser round unfortunately had some scheduling issues. One day before the interview, HR called and said it would be rescheduled to the next week. On the new date, I joined the meeting at the scheduled time, but no one joined. Later HR said the interviewer was waiting at a different time slot that I had not been informed about. Eventually it was rescheduled again for the next week. This round is where things went wrong. The interviewer focused heavily on Leadership Principles. At one point I discussed an example where we optimized an API and reduced latency from 10 seconds to 200 ms. I explained the architecture and the optimizations we applied. However, he kept pushing deeper into every intermediate step of the optimization process and wanted a very detailed breakdown of how the latency was reduced. I explained everything I knew, but I could sense the interviewer wasn’t fully convinced. The round lasted 1 hour 10 minutes, even though it was scheduled for 40 minutes. I spent most of that time explaining and answering follow-up questions. At that point I already had a feeling that I might have messed up. About a week later, I received the rejection email. Takeaway My main advice for anyone interviewing at Amazon: Prepare Leadership Principles thoroughly. Strong DSA performance is important, but LP answers can significantly affect your chances, especially in the Bar Raiser round.
About This Question
This is a reported interview question from a amazon interview for a eng manager role during the oa round reported in 2026.
It covers the following topics: Arrays, Graph, Greedy, Math, Binary Tree, Sliding Window, Queue, Behavioral, Heap, Two Pointers, Stack .
Difficulty rating: Easy
More Amazon Interview Questions
About Amazon Interview Reports
This question was reported by a candidate who interviewed at Amazon. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Amazon are the higher-signal extractions to take from this report.
For broader preparation context, the Amazon interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Amazon reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Amazon Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Amazon reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.