amazon logo
Amazon· SDE New Grad

Amazon - Berlin | SDE(New Grad) | Rejected after OA3

Result
Rejected
Location
berlin
Posted
12 Mar 2020
278 reads

Summary

I applied for an SDE New Grad position at Amazon Berlin and was rejected after completing three Online Assessment rounds, despite performing well on the coding and logical ability tests.

How it went

I applied for an SDE New Grad position at Amazon in Berlin on February 20, 2020. The recruitment process involved three Online Assessment rounds.

My first Online Assessment (OA1) was a basic debugging round, which I completed on February 28, 2020, successfully solving all 7 questions. Immediately after, I received the invitation for OA2.

The second Online Assessment (OA2) presented two fairly straightforward coding questions, which I passed all test cases for. These were:

  • Searching for an element in a 2D array.
  • Copying a linked list with random pointers.
I received the invitation for OA3 on the same day.

My third Online Assessment (OA3) was a work simulation test based on Amazon's leadership principles and a logical ability test. I completed this on February 10, 2020, solving 18 out of 24 logical ability questions.

Unfortunately, I received a rejection email on February 11, 2020, despite feeling that I performed well, especially in OA3. I am unsure about the reason for the rejection.

Questions asked (2)

  1. 01

    Search in 2D Matrix

    Data Structures & Algorithms · Medium

    Given an m x n integer matrix with the following properties:
    1. Each row is sorted in non-decreasing order.
    2. The first integer of each row is greater than the last integer of the previous row.
    Determine if a target value is present in the matrix.

  2. 02

    Copy List with Random Pointer

    Data Structures & Algorithms · Medium

    A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. Construct a deep copy of the list. The deep copy should consist of exactly n new nodes, where each new node has its value set to the value of its corresponding original node. Both the next and random pointer of the new nodes should point to new nodes in the deep copy.

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!