Amazon | AWS(Aurora Team) | L4 | Bengaluru, India (Reject) [April, 2022]
- Result
- Rejected
- Location
- bengaluru, india
- Experience
- 1.2 years
- Posted
- 5 May 2022
Summary
I applied for an L4 role at Amazon's AWS Aurora team in Bengaluru, completing an online assessment and three subsequent DS/Algo rounds, which ultimately resulted in a rejection.
How it went
I applied to Amazon with 1.2 years of experience via their online portal. Within a week, I received an Online Assessment (OA) which included a modified version of the pair of song duration problem and another BFS question. Although I couldn't pass all test cases (missing one for each), I surprisingly received a callback for the first interview round.
First Round (DS/Algo)
This round began with a significant focus on Amazon's Leadership Principles (LPs). With about 20-25 minutes remaining, I was given a coding question: You are given an array of columns and you have to return the unique columns from them, if you find a duplicate then append an incremental integer to the end of that column and go on. The array order shouldn't change. For example: IP: [a, b, c, d, d, d] => OP: [a, b, c, d, d_1, d_2]; IP: [a, b, c, d, d, a, d, b] => OP: [a, b, c, d, d_1, a_1, d_2, b_1]; IP: [a, b, c, a, d, d, a_1, d, b] => OP: [a, b, c, a_2, d, d_1, a_1, d_2, b_1]. I was able to solve this problem.
My second round was scheduled for the same week.
Second Round (DS/Algo)
Again, the initial 10 minutes were dedicated to discussing Leadership Principles. Following this, I was presented with the very well-known 'Rotting Oranges' problem. I managed to solve it efficiently, ahead of time. After solving, the interviewer and I had a brief discussion about Work-Life Balance and the culture within the Aurora Team.
I was expecting a Hiring Manager round next, followed by an HR round. However, another DS/Algo round was scheduled.
Third Round (DS/Algo)
This interviewer rigorously grilled me on Leadership Principles for about 40-45 minutes. Afterwards, I was given the following question: Print all possible triangles (consider that there are no missing links to its sibling). The interviewer also provided a diagram for clarity:
A1 /
A2 --- A3 / \ /
A4 -- A5 - A6 - A7 / \ / \ / \ /
B1-B2-B3-B4-B5-B6-B7-B8
Examples given were:
[A1, A2, A3][A2, A4, A5][A3, A6, A7][A1, A2, A4, A5, A6, A7, A3]The interviewer pressed me hard on the exact time complexity. I presented my best solution within the last 10 minutes and explained its time complexity, though I suspect the interviewer might have been looking for a different approach.
Two days later, I received my rejection email. Despite this, I'm continuing my interview process with other companies and remain optimistic.
Questions asked (4)
- 01
Modified Pair of Song Duration
Data Structures & Algorithms
A modified version of the
pair of song durationproblem. - 02
Process Array to Return Unique Columns with Incremental Suffix
Data Structures & Algorithms
You are given an array of columns and you have to return the unique columns from them. If you find a duplicate, then append an incremental integer to the end of that column and go on. The array order shouldn't change.
Examples:IP: [a, b, c, d, d, d] => OP: [a, b, c, d, d_1, d_2]IP: [a, b, c, d, d, a, d, b] => OP: [a, b, c, d, d_1, a_1, d_2, b_1]IP: [a, b, c, a, d, d, a_1, d, b] => OP: [a, b, c, a_2, d, d_1, a_1, d_2, b_1] - 03
Rotting Oranges
Data Structures & Algorithms
The most famous question, Rotting Oranges.
- 04
Print All Possible Triangles in a Given Tree Structure
Data Structures & Algorithms
Print all possible triangles (consider that there are no missing links to its sibling).
A1 /
A2 --- A3 / \ /
A4 -- A5 - A6 - A7 / \ / \ / \ /
B1-B2-B3-B4-B5-B6-B7-B8
Examples:[A1, A2, A3][A2, A4, A5][A3, A6, A7][A1, A2, A4, A5, A6, A7, A3]