I recently got chance to interview at Amazon. Sharing my experience to help others as the posts here helped me a lot.
Education - B.E. (Computer Science) from Tier-3 college (2024 batch)
Current Experience - 1 year of experience at service based company.
Applied on online portal on 25 Nov 2024.
22 December 2024
Received OA link.
3 sections -
1) DSA (2 Questions)
i) Dont remember it exactly
ii) Implement Push and pop in linked list
2) Work Simulation Assessment
3) Behavioural
11 Febuarary
Received mail for interview scheduled on 17 and 18 Feb.
17 Feb - Round 1(Technical)
Started with introduction of interviewer then my introduction. Asked about my projects.
Then proceeded with 2 LC questions -
- Find Median from stream of numbers. (LC Hard)
- Find maximum sum level in Binary Tree (LC Medium)
Was able to get both the questions done within the time and no LP questions were asked as no time was left.
Got mail for second round after an hour.
18 Feb - Round 2(Technical)
Started with introduction of interviewer then my introduction. Asked about my projects.
Then asked 2 LP questions -
- Have you ever helped a peer at work?
- Have you ever missed a deadline?
I answered both but not sure if the interviewer was satisfied.
Then asked 2 LC mediums -
- Find Single Element from a sorted array.
- Remove the consecutive nodes from a linked list with sum as zero.
Was able to answer 1st question but took about 40 min in implementation.
Did not had much time for 2nd but still was able to code it up by last couple of minutes.
However for the last problem, not sure if the code would pass all test cases.
Got mali for third round after 2 days.
24 Feb - Round 3(Technical + Bar Raiser)
Started with Introduction then asked about my project. Specifically asked about the critical or challenging things that I did in it. Was able to explain him two examples from my project. Did a lot of follow ups I had to explain him everything in great detail about what my role was in the tasks I did.
Then he asked me a coding problem:
Given a binary tree find distance between two nodes if each node only know about its parent and not about its child.
Was able to solve that easily.
Then he modified the question a little. Earlier root node was having parent as NULL now he said the root node will have parent as any one of the leaf nodes in this tree.
Explained him an approach to use map to store visited nodes. This approach was taking space complexity O(N)
He asked me to optimize space complexity to O(1).
I was trying to explain him using the slow and fast pointer approach although I was not able to get the answer but was trying to derive answer using that.
By that time the time was over he just said its ok he got what he wanted to know and just asked to explain O(N) space complexity approach and left.
27 Feb - Congratulations Mail
I received call from HR that I have cleared all rounds and have been selected. Asked me about my notice period and current package, relocation etc.
Later the same day, I received an congratulations email and next steps.
I accepted the offer.
For compensation structure, check https://leetcode.com/discuss/compensation/6478524/Amazon-SDE-1-Bangalore-or-University-Grad-2024
Due to high public demand for the LP questions list that I curated, I have added all questions from that list in this post: https://leetcode.com/discuss/interview-question/6482779/Amazon-LP-Questions-list-that-I-created-while-preparing-for-my-interview
Hope this expereience helps someone.
God is great!
Om Namah Shivay!
Jay Shree Ram!