College : Tier 3
YOE : 2 Yr 11 months
Prev Company : A product based company (not any FAANG)
OA
A simple ad hoc question. (LC easy)
Given an array of numbers find the no of swaps to make the array sorted where each swap is for the smallest pair (ai,aj) such that i < j & ai>aj.
eg 6 1 4 5 2 -> 6 swaps
I was able to solve both but only 11/12 testcases matched for Q2.
Virtual Round 1
Answered all of them. Interviewer seemed satisfied with my design
Round 2 (Code)
Solved both Questions
Round 3 (System Design)
HM (Bar Raiser)
Went well was not able to answer the follow up though
Finally after week got my selection email. The interviewers were really good and I really enjoyed the interviews. Make sure to think of 2 scenarios for yours LPs( Leadership Principle questions) before the interviews
Compensation Details : https://leetcode.com/discuss/compensation/1328851/amazon-sde2-bangalore/1005239