amazon logo
Amazon· SDE-1

Amazon Sde-1 Interview Experience (Verdict : selected)

Posted
30 Mar 2026
295 reads

Summary

I went through four rounds of Amazon SDE‑1 interviews—including an online assessment, two on‑site DSA rounds, a hiring‑manager interview, and a bar‑raiser—and was ultimately selected.

How it went

Online Assessment (OA)
Coding: 1 Easy and 1 Medium DSA question
Work Style Assessment: Standard Amazon Leadership Principles (LP) questions (Strongly Agree to Strongly Disagree)

Round 1: DSA (onsite)

  • Technical: Detonate the Maximum Bombs (follow‑up: variation involving a directed graph)
  • Behavioral (STAR‑based): Deadline‑related – Tell me about a time you handled tasks with a strict deadline

Round 2: DSA + Project Discussion (onsite)

  • Technical: Aggressive Cows (follow‑up on time and space complexities)
  • Behavioral (STAR‑based): Same question again – Tell me about a time you handled tasks with a strict deadline (different interviewer, same question)

Round 3: Hiring Manager (Gen - AI) (virtual)

  • Technical: Next Greater Element (follow‑up on complexity)
  • Gen AI Discussion: How do you make the best use of LLMs? Do you verify/validate the results? If yes, how? Tips for using LLMs efficiently (1–2 additional related questions)

Round 4: Bar Raiser (Leadership Principles Focus) (virtual)

  • Behavioral (STAR‑based):
    • A scenario where you had to deep dive (with extensive follow‑ups)
    • A scenario where you missed a commitment or deadline (with deep probing)
    • A scenario where you had to convince someone of your approach

This interviewer really grilled me on every answer, but I made sure to clearly explain the situation, my reasoning, and the outcomes.

Overall Experience:

I really enjoyed interviewing at Amazon. Feel free to ask any questions in the comments!

Update – selected

Questions asked (3)

  1. 01

    Detonate the Maximum Bombs

    Data Structures & Algorithms

    Problem about detonating the maximum number of bombs, with a follow‑up variation involving a directed graph.

  2. 02

    Aggressive Cows

    Data Structures & Algorithms

    Classic problem of placing cows in stalls to maximize the minimum distance between any two cows, with follow‑up questions on time and space complexities.

  3. 03

    Next Greater Element

    Data Structures & Algorithms

    Given an array, find the next greater element for each element, with follow‑up discussion on complexity.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amazon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!