Amazon | SDE-1 | Offer
Anonymous User
6336

Status: New grad (3 months Full-Time + 6 months internship)

Leetcode : Started in Apr 2021. [350+ Medium , 150+ Easy , 50 Hard ]

Hi all, I recently got an offer from Amazon for SDE-1 role. The whole process took more than 6 moths. I have shared my experience with you all.

15 APR 2021
Applied for SDE-1 position.

OA Round [25 MAY 2021]
Got OA link and had one week time to attempt the test. I attempted the test on 30th may.
There were two coding questions. Don't remember the exact question, but they were of medium difficulty.

30 Aug 2021
Received a mail that I have cleared the OA round and they are scheduling my first and second round of interview on 5 SEP.

First Round [5 SEP 2021]
Interviewer was a SDE-1 with 2+ years of experience at Amazon. He started with brief introduction and then jumped on to the coding question.

  1. https://leetcode.com/problems/search-a-2d-matrix/
    I started with brute force solution and was able to give optimised solution very quickly as I had solved this question before.

  2. This was design based question. I don't exactly remember the question. I came up with two-three approaches , but the interviewer was not pleased with any of them. With just 15 min remaining he jumped to another question.

  3. Third question was similar to this one https://leetcode.com/problems/reverse-nodes-in-k-group/
    I directly gave the optimised solution and quickly coded the solution.

Second Round [5 SEP 2021]
Interviewer was a SDET with 5+ years of experience at Amazon. She also started with brief introduction and then jumped on to the coding question.

  1. Given a binary tree and target node. By giving the fire to the target node and fire starts to spread in a complete tree. The task is to print the sequence of the burning nodes of a binary tree.

I came up with bfs approach, she was satisfied with it and asked me to quickly write the code. she then aksed me to dry run the code. There were few bugs in the code, which I found during the dry run , I quickly fixed the bugs and then she moved to second question.

  1. https://leetcode.com/problems/binary-tree-maximum-path-sum/

I struggled a lot with this question and was able to come up with the solution at the end. When I tested my approach on the leetcode it cleared 92/94 test cases. I missed some of the edge case. At the end she aksed me some LP questions.

After couple of days got a call from the recruiter that I have cleared the second round and have third on 14 SEP.

Third Round [14 SEP 2021]

This was HM round. He started with brief introduction about him and the team. He then asked me some question about my work during my internship.

  1. I was asked to write a pseudo code for the reader writer problem. I made some mistakes in the first attempt and was able to come up with perfect solution in the second attempt.

  2. He aksed one coding question. I came up with brute force solution and then optimised it. He asked me to further optimise the solution. I was not able to optimise it as I had no idea about trie data structure.

  3. What happens when you type a url in the web browser.

  4. How DNS works.

  5. Some questions on demand paging.

  6. SQL v/s NO-SQL

At the end he asked me some LP questions.

After third round there was no communication from the recruiter. I tried to reach her through call and mail but there was no response. Got a call from recruiter after more than 3 weeks that I have cleared the third round and they have scheduled the fourth round on 13 OCT.

Fourth Round [13 OCT 2021]

This round was taken by one of the SDE-2. This round started with brief introduction and then he asked me some questions about my project and my work during my internship. He then asked me two coding question.

  1. https://leetcode.com/problems/max-consecutive-ones-iii/

At first I came up with O(n^2) solution and then optimised it to O(n). He was satisfied with the solution and then moved on to the second question.

  1. Check whether a number is a perfect square or not. You cannot use inbuilt SQRT function.

I gave a O(sqrt(n)) solution, then came up with O(logn) solution at the end. He then asked me some LP questions.

After one week I got a call from the recruiter and got offer for SDE-1 role.

Comments (12)