Amazon | SDE1 | Feb 2025 | Offer

amazon logo
amazon
SDE I1 yearsOffer
March 3, 202514 reads

Summary

I successfully cleared the SDE1 interview process at Amazon in February-March 2025, culminating in an offer. The rounds primarily focused on Data Structures & Algorithms and Amazon's Leadership Principles.

Full Experience

My journey for the SDE1 role at Amazon began with an interview invitation received on February 21, leading to rounds conducted between February 24 and March 3. The entire process was eliminatory, consisting of several stages rigorously testing both technical prowess and alignment with Amazon's Leadership Principles.

R1: DSA + Leadership Principles (Feb 24)

This round was conducted by an SDE3 with extensive experience. I was presented with two data structure and algorithm problems:

  • Q1: Print Zig-Zag in a Binary Tree
  • Q2: Largest BST in a Binary Tree

I successfully solved both problems, articulating my approach clearly, writing the complete code, and performing a thorough dry run. I also discussed the time and space complexities involved. This round concluded with a pass.

R2: DSA + Leadership Principles (Feb 26)

This round was rescheduled and involved two interviewers, one an SDE1 and another with significant experience. The problems I encountered were:

  • Q1: Modified Two Sum problem
  • Q2: Keys and Rooms (Graph)

Similar to the first round, I managed to solve both problems, explained my thought process, coded them out fully, and performed a dry run while analyzing their time and space complexities. I passed this round as well.

R3: Bar Raiser (Mar 3)

The final round was with a Bar Raiser, a long-tenured Amazonian from the business team. This round was exclusively dedicated to Amazon's Leadership Principles and behavioral questions. I addressed approximately 6-7 questions and their follow-ups. While I felt reasonably confident, I would rate my performance around a 7-8 out of 10. Nonetheless, I successfully cleared this round.

Overall, the interview process felt very streamlined. The technical rounds had a clear emphasis on DSA and LPs, while the bar raiser was purely behavioral. I believe my technical performance was strong, and I performed decently in the LP discussions. After a couple of days, I received the offer!

Interview Questions (3)

Q1
Print Zig-Zag in Binary Tree
Data Structures & AlgorithmsMedium

Given a binary tree, print its nodes level by level such that nodes at odd levels are printed from left to right, and nodes at even levels are printed from right to left (zig-zag traversal).

Q2
Largest BST in Binary Tree
Data Structures & AlgorithmsMedium

Given a binary tree, find the largest subtree which is a Binary Search Tree (BST). You should return the size of the largest BST.

Q3
Keys and Rooms
Data Structures & AlgorithmsMedium

There are N rooms and you start in room 0. Each room has a list of keys to other rooms, and you can only enter a room if you have its key. Initially, you have all the keys to room 0. Determine if it's possible to visit all the rooms.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!