amazon logo
Amazon· SDE 1

Amazon | SDE 1

Experience
1.1 years
Posted
12 Jun 2025
282 reads

Summary

I interviewed for an SDE 1 position at Amazon, undergoing two rounds involving LeetCode-style problems, LP questions, and an Object-Oriented Design problem. I was ultimately rejected.

How it went

1st round: 1 LP question 1st question - Given an n x n matrix and an integer x, find the position of x in the matrix if it is present. Otherwise, print “Element not found”. All elements in the array are sorted in ascending order in row and column.

Sample 2 3 5 7 9 10 11 13 15 17 19 20 21 23 25 27 28 30 31 33 35 37 39 40 41 43 45 47 49 50 44 46 48 51 58 60

ip: 23 op: (3,2)

ip: 4 op: Element not found

2nd question - Given an infinite stream of integers, find the kth largest element at any point of time. Example: [10,20,11,70,50,40,100,5,...] K=3 Output :[-1,-1,10,11,20,40,

2nd round: few LP question

Amazon Warehouses Team uses a software to sort all the incoming online orders based on their priority and stores the information in a database. This information is made available to the packaging system which continuously picks the order with the highest priority and packages it for delivery.

The OrderSortingService has the following functional requirements:

  1. Support adding new orders continuously coming in from amazon.com.
  2. Support getting the order with the highest priority.
  3. Store the incoming orders.

Need to write the code in OOP's way. All the layers required like controller, repository, service.

Not able to complete in time.

Verdict: rejected.

Questions asked (3)

  1. 01

    Search in Sorted 2D Matrix

    Data Structures & Algorithms · Medium

    Given an n x n matrix and an integer x, find the position of x in the matrix if it is present. Otherwise, print “Element not found”. All elements in the array are sorted in ascending order in row and column.

    Sample 2 3 5 7 9 10 11 13 15 17 19 20 21 23 25 27 28 30 31 33 35 37 39 40 41 43 45 47 49 50 44 46 48 51 58 60

    ip: 23 op: (3,2)

    ip: 4 op: Element not found

  2. 02

    Kth Largest Element in a Stream

    Data Structures & Algorithms · Medium

    Given an infinite stream of integers, find the kth largest element at any point of time. Example: [10,20,11,70,50,40,100,5,...] K=3 Output :[-1,-1,10,11,20,40,

  3. 03

    Order Sorting Service Design

    System Design · Hard

    Amazon Warehouses Team uses a software to sort all the incoming online orders based on their priority and stores the information in a database. This information is made available to the packaging system which continuously picks the order with the highest priority and packages it for delivery.

    The OrderSortingService has the following functional requirements:

    1. Support adding new orders continuously coming in from amazon.com.
    2. Support getting the order with the highest priority.
    3. Store the incoming orders.

    Need to write the code in OOP's way. All the layers required like controller, repository, service.

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!