Amazon SDE-1 Interview Experience | Bangalore | University Grad 2024 | Selected
Round 1 (Technical)
Questions:
- Find Median from stream of numbers. (LC Hard)
- Find maximum sum level in Binary Tree (LC Medium)
Candidate's Approach
The candidate was able to solve both questions within the allotted time. No low-priority (LP) questions were asked due to time constraints.
Interviewer's Feedback
No feedback provided.
Round 2 (Technical)
Questions:
- Have you ever helped a peer at work?
- Have you ever missed a deadline?
- Find Single Element from a sorted array. (LC Medium)
- Remove the consecutive nodes from a linked list with sum as zero. (LC Medium)
Candidate's Approach
The candidate answered the behavioral questions but felt uncertain about the interviewer's satisfaction. For the coding questions, the candidate successfully implemented the first question but took about 40 minutes. The second question was coded in the last couple of minutes, but the candidate was unsure if the code would pass all test cases.
Interviewer's Feedback
No feedback provided.
Round 3 (Technical + Bar Raiser)
Questions:
- Given a binary tree find distance between two nodes if each node only knows about its parent and not about its child.
Candidate's Approach
The candidate explained two examples from their project in detail. They solved the initial problem easily but struggled with an optimization challenge when the root node's parent was changed to a leaf node. The candidate attempted to use a slow and fast pointer approach but could not derive the answer in time. They explained the O(N) space complexity approach before the time was up.
Interviewer's Feedback
No feedback provided.