amazon logo
Amazon路 SDE-1

Amazon SDE-1 Interview Experience | University Talent | India

Location
India
Experience
0.83 years
Posted
18 May 2025
333 reads

Summary

I recently completed my interview process with Amazon for an SDE-1 role, which included an Online Assessment, two technical rounds, and a behavioral/LP round. I successfully received an offer after completing all rounds.

How it went

Hi everyone!

I recently completed my interview process with Amazon, and I鈥檇 like to share my experience. Hope it helps others in their prep!

馃帗 Background:

  • 2024 Graduate (Tier-1 college)
  • 10 months experience at a startup
  • LeetCode Rating: 1950, Codeforces: 1450

Round 1: Online Assessment (OA)

馃搮 Date: 15th Feb 2025

  • 2 Easy-Medium DSA problems (don鈥檛 remember exact ones) Finished in ~20 minutes
  • behavioral questions

Got a call on 7th May for scheduling! (yes, 3 months after OA 馃槄)

Round 2: Technical Interview

馃搮 Date: 9th May 2025

  • Q1: BFS/DFS-based 2D matrix question (similar to Rotten Oranges)
  • 1LP Question
  • Q2: Predict the Winner
    • Solved using recursion + DP
    • Follow-up: How to get individual scores?
      • Answered using total sum and difference logic (a + b = total, a - b = diff)

Got a call same day for Round 3 scheduling!

Round 3: Technical Interview

馃搮 Date: 13th May 2025

  • Started with 2 Leadership Principle (LP) questions
  • Q1: K-th Largest Sum of Contiguous Subarray
    • Gave O(N虏 log K) solution using subarray sums + min heap
  • Q2: Longest Subarray with At Most K Frequency
    • Solved using 2-pointer approach

Got a call after 2days for Round 4 scheduling!

Round 4: Behavioral + LP

馃搮 Date: 16th May 2025

  • 2 Leadership Principles Questions, Discussed on projects
  • Went well overall

Now waiting for the results... fingers crossed 馃

Update:(21/05/2025) Got the Offer馃巿

Questions asked (4)

  1. 01

    BFS/DFS on 2D Matrix (Rotten Oranges Type)

    Data Structures & Algorithms 路 Medium

    A 2D matrix problem solvable with BFS or DFS, similar to the 'Rotten Oranges' problem (LeetCode 994), which typically involves finding shortest paths or connected components on a grid.

  2. 02

    Predict the Winner

    Data Structures & Algorithms 路 Medium

    Given an array of non-negative integers. Two players take turns choosing one of the numbers from either end of the array. The player who makes the sum of their chosen numbers larger wins. Determine if the first player has a winning strategy. Follow-up: How to get individual scores?

    Open the problem
  3. 03

    K-th Largest Sum of Contiguous Subarray

    Data Structures & Algorithms 路 Hard

    Find the K-th largest sum among all possible contiguous subarrays of a given array.

  4. 04

    Longest Subarray with At Most K Frequency

    Data Structures & Algorithms 路 Medium

    Find the length of the longest subarray where each element appears at most K times.

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!