Amazon SDE2 | Selected
Summary
I was offered an SDE2 position at Amazon after clearing multiple interview rounds (HLD, DSA, LLD, Bar Raiser), solving several coding problems and LP questions, and ultimately receiving a selection verdict.
Full Experience
Hey everyone, I have been recently offered SDE2 offer at Amazon and wanted to share my interview experience.
Recuriter reached out to me on LinkedIn in the first week of March and cleared OA by weekend.
After clearing the OA, I was scheduled further rounds 2 weeks later at Amazon office.
Round 1: HLD
Started with 2 LP questions. Design BookMyShow. I gathered necessary requirements from the interviewer and had discussions on Search movies/theatres and Seat concurreny.
Round 2: DSA
1.https://leetcode.com/problems/ipo/description/ 2.https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/description/ 3.https://leetcode.com/problems/search-in-rotated-sorted-array/description/
I was able to solve Q1 completely with code, explained only the approach for Q2 and solved Q3 with code.
Ended with 2 LP questions.
Round 3: LLD
Started with 2 LP questions. Design Ride sharing service (MoveInSync). I started with listing out the key functionalities and wrote necessary service classes / data models / entities.
Round 4: Bar Raiser (Virtual)
Started with 2 LP questions. DSA Question: Give a subset of arrays [[1,2,3], [1,6], [7,6]], return the original array (there can be more than one solution). O/P: [1,2,3,7,6] Solved using topological sort (Kahn's algo) after a hint with code.
Verdict: Selected
Compensation offered: YOE: 3.8 years Base salary: 44 LPA First year bonus: 18 LPA Second year bonus: 13.5 LPA RSUs: 210 units (5 + 15 + 40 + 40 over 4 years)
Interview Questions (1)
Reconstruct Original Array from Subset Arrays
Given a collection of subset arrays, e.g., [[1,2,3], [1,6], [7,6]], reconstruct an original array that could generate these subsets. The original array may not be unique; any valid reconstruction is accepted. Example output for the given input: [1,2,3,7,6].