amazon logo
Amazon· SDE II

Amazon | Interview Experience | SDE 2 |

Posted
21 May 2026
76 reads

Summary

I applied directly on the career portal, completed the online assessment the same day, and was invited to a technical interview where I solved two DSA problems (3Sum Closest and Number of Islands II) but was ultimately rejected.

How it went

Last month I've given SDE-II Interview at Amazon. Below is my interview experience for same.

Application

  • Directly applied on career portal
  • Got OA next day. Completed same day
  • Got Interview call next day and scheduled first round 1 week after that

OA

Don't remember the questions

  • 2 DSA Questions - (Easy to medium level)
  • Given a full stack project based on backend framework you select and a list of bugs. You've to go through code and find and fix the bug. AI was also provided for this question but it was kind of useless, it won't even help to understand the codebase and search something inside it.
  • Some behavioral type design choice questions

Round - 1 (DSA)

2 easy - medium level DSA Problems were asked in this round

  • LC 16 - 3Sum closest : I was able to provide 3 approaches with thier space and time complexity along with explaination and dry run to prove my intuition. Constraints: n upto 10^3

    • Brute force O(N^3) approach
    • Binary search based O(N^2 logn) approach
    • Two pointers base O(N^2) approach
  • LC 305 - Number of Islands II : Same as previous question I was able to provide 2 approaches. Constraints same as origin problem.

    • Brute force O(n^2*q) approach
    • DSU based O(q + n^2) approach
  • Typical tell me about a time XXXX LP questions

Verdict : Rejected

Questions asked (2)

  1. 01

    3Sum Closest

    Data Structures & Algorithms · Medium

    Given an integer array nums and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    Constraints

    • 3 <= nums.length <= 10^3
    • -10^4 <= nums[i] <= 10^4
    • -10^4 <= target <= 10^4
    Open the problem
  2. 02

    Number of Islands II

    Data Structures & Algorithms · Hard

    You are given a m x n 2D grid initialized with water. A list of positions is provided where each position adds a piece of land. After each addition, return the number of islands. An island is a group of adjacent lands connected vertically or horizontally.

    Constraints

    • 1 <= m, n <= 10^3
    • 1 <= positions.length <= 10^4
    Open the problem

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!