Amazon SDE-2 [Rejected]
- Posted
- 26 Jul 2026
Summary
I completed an online assessment and two interview rounds for an SDE-2 position at Amazon, but was rejected.
How it went
Online Assessment
Question similar to https://leetcode.com/problems/distance-between-bus-stops
Plus, there was an IDE style based one hour duration test to fix the rest API endpoints, I chose springboot backend code. The fixes were included around JWT security.
Interview 1
- Leadership principles
- Design a basic calculator, or arithmetic expression evaluator. Given an input String, return an Integer.
- How can you extend it to various operators, interviewer wanted to know on the terms of making an operator interface, implementing it, etc.
Interview 2
- Leadership principles
- Asteriod collision
- Followup: You need to answer q queries. Each query is a pair (l, r).
For each query, imagine only the asteroids in the subarray asteroids[l .. r] exist and collide among themselves.
Return the number of survivors.
Verdict: Rejected
Not sure why, might be because I couldn't solve the followup or I rescheduled the interviews a lot.
Questions asked (3)
- 01
Distance Between Bus Stops
Data Structures & Algorithms · Easy
Open the problemGiven an array that represents the distance between each pair of consecutive bus stops, and two bus stop indices, calculate the shortest distance between the two stops.
- 02
Basic Calculator / Arithmetic Expression Evaluator
Data Structures & Algorithms
Design a basic calculator that evaluates an arithmetic expression provided as a string and returns the result as an integer. The evaluator should support extending to various operators using an operator interface.
- 03
Asteroid Collision with Query Subarray
Data Structures & Algorithms
Given an array representing asteroids, determine the number of survivors after collisions. Follow‑up: for multiple queries each defined by a pair (l, r), consider only the subarray asteroids[l..r] and return the number of survivors for that subarray.