Amazon || SDE2 || Rejected
- Result
- Rejected
- Experience
- 3 years
- Posted
- 17 Nov 2024
Summary
I recently interviewed for an SDE2 role at Amazon, which involved two coding rounds and Leadership Principles questions. Despite a good second round, I was rejected due to my performance in the first round, where I struggled with an optimized solution and LP questions.
How it went
I have over 3 years of experience at a product-based MNC and recently appeared for an SDE 2 role at Amazon. There were a total of two interview rounds, both conducted on a Saturday.
The process started with an OA round, which included two easy-to-medium LeetCode coding questions and numerous LP-based MCQ questions.
My first round began with introductions and project discussions, followed by leadership principle questions. I struggled while answering some of these. The interviewer mentioned there would be two coding questions, one medium and another medium-hard level. For the first question, All Nodes Distance K in Binary Tree, I initially proposed O(V+E) time and various space solutions (O(N), O(E), O(h)). However, the interviewer insisted on an O(1) space solution. Despite hints, I couldn't crack it. Consequently, the second question was not asked because I couldn't provide the most optimized solution for the first.
The second round's interviewer seemed unprepared. It also started with introductions and project discussions. About 30 minutes were dedicated to leadership questions, which included prompts like: 'Any challenging project?', 'A time when I learned new things and implemented them in a project,' and 'When I went beyond my scope of work.' Following this, I was asked an easy coding question: Top K Frequent Words. I first provided a brute-force solution and then optimized it to the most efficient one. At the end, I asked a few questions about the interviewer's work in Amazon Payments.
Overall, my first round was not good, both on LP and the coding question, but my second round went well. I didn't ask for feedback, as I felt the first round's performance likely sealed my fate. I hope this experience helps others.
Questions asked (5)
- 01
All Nodes Distance K in Binary Tree
Data Structures & Algorithms · Medium
Open the problemGiven the
rootof a binary tree, atargetnode in the tree, and an integerk, return an array of the values of all nodes that have a distancekfrom thetargetnode. The distance between two nodes is the number of edges in the shortest path between them.
I initially gave O(V+E) time and various space solutions (O(n), O(E), O(h)), but the interviewer insisted on an O(1) space solution. I was unable to provide it despite hints. - 02
Tell me about a challenging project.
Behavioral
Describe a challenging project you have worked on. What was the challenge, and how did you overcome it?
- 03
Time you learned new things and implemented them.
Behavioral
Describe a situation where you had to learn new things and successfully implemented them into a project.
- 04
Time you went beyond your scope of work.
Behavioral
Share an example where you took initiative and went beyond your defined scope of work.
- 05
Top K Frequent Words
Data Structures & Algorithms · Medium
Open the problemGiven an array of strings
wordsand an integerk, return thekmost frequent words. Return the answer sorted from most frequent to least frequent. When two words have the same frequency, sort them alphabetically.