Preparing for an interview? Check out Cracking the Coding Interview
Published on

Amazon | SDE-2 | Bangalore | Another failed attempt

Author
  • Shared Anonymously

Hello, I am currently working in a product company and have 5 years of experience.

In my third complete cycle with Amazon, I've consistently approached the final stages only to encounter rejection each time. Though this time the recruiter ghosted me and didn't even bother to share the feedback. But sharing my experience so maybe someone can benefit from it.

Round 1 - Coding Assessment:

  1. Two medium-level LeetCode questions were asked, one focusing on trees and the other on arrays. Unfortunately, I don't remember the exact tree question. But it was based on fundamental tree traversal concepts.
  2. The second question posed a scenario involving a theater with n seats arranged in m columns. I was asked to determine the number of possible seating arrangements to accommodate groups of four individuals sitting together. Input parameters included the coordinates of already occupied seats.

Round 2 - \xA0HLD \xA0
This round went smooth IMO. I had to design an online chess system taking care of leaderboard and organising competitions followed by 2 LP questions.

Round 3 - LLD
2 LP questions, the problem of designing a task scheduler. Additionally, the interviewer explored multiple aspects related to estimating the completion time for tasks within the scheduler. I was able to come up with the high-level plan first and later on drew the UML diagram showing the user journey.

Round 4 - Hiring Manager - Bar raiser

  1. The interviewer dug into my past experiences, pulling details from my resume.
  2. \xA02 LP questions
  3. \xA01 LC hard problem. This seemed very tricky to me especially\xA0since\xA0I never came across such a problem before. The problem was to determine if a node would be of type Doubly Linked List or a tree. I was partially able to code the solution for DLL but couldn't come up with the logic for determining a tree data structure on time. He gave a hint in the end to see if there is a cycle to determine the tree structure. \xA0The Node structure looked like below.
struct Node{  
Node* node1;  
Node* node2;  
}

Learnings: I did work hard and gave my best but maybe I fell short. Hopefully, I will make it soon. While I felt satisfied with my performance overall, I was at least expecting some feedback, which unfortunately seems to be a rarity nowadays.

My previous experience:- https://leetcode.com/discuss/interview-experience/2702603/Amazon-SDE-2-London

Good luck everyone!!

Report • Mark as Helpful