YOE: 5 years this summer\nBSCS\n\nApplied through a hiring platform and a recruiter from Amazon reached out. Started with OA and once completed, I was told the next day that I would be moving to on-site. However, because of corona virus, it would be virtual.\n\nOAs\nhttps://leetcode.com/discuss/interview-question/344650/Amazon-Online-Assessment-Questions\n\n\n1 .SDE - \n30-35 mins: LP\nRemaining: A question involving Trie + numeric keypad. I felt this was a hard level question to be asked in half hour.\nCouple mins for me to ask questions.\n2. SDE \u2013\n30-35 mins: LP\nRemaining: Variation of find command in unix. Again, I felt this was a hard level question to be asked in half hour.\nCouple mins for me to ask questions.\n3. SDM \u2013\n30-35 mins: LP\n~25 mins: Design parking lot + followup. Finished early (or just gave up if my answers were not not good enough). It took me some time initially for me and the interviewer to be on the same page.\nSpend about 5 mins on LPs again.\nCouple mins for me to ask questions.\nI felt this one was a tricky one since me and SDM started on the wrong page. But I explained thoroughly what I was thinking at each step. Afterwards, interviewer kept assuring me that I was on the right path.\n4. SDE -\n~25 mins: LP.\nRemaining:  Finished LP early so started with technical question to find top K elements (with some variation). \nAsked about testing and found an edge case that what if there are multiple elements with top K frequency (ie more than one elem with same top frequency). I then recommended building a hashmap that will keep frequency as key and all matching elements as values. {\u201C5\u201D: [\u201Ca\u201D,\u201Db\u201D,.\u2026]} and using map keys (ie frequency) to get top K elements from the heap.\nFollowup were more like system design problem where data cannot be kept in memory, how the request and response would like, distirbuted file system, replication, etc. Something like\nhttps://github.com/DreamOfTheRedChamber/system-design/blob/master/topk.md\nCouple mins for me to ask questions.\n5. SDE \u2013 Only LPs. I believe this was bar raiser. Ended about 10 mins early since they were done and I didn\'t have more questions to ask.\n\nI spend quite some time over the last few months on LC solving questions and looking at solutions from others. I also did LC premium for a month however it was mainly for preparation for Google but I couldn\u2019t even go on-site. (More details [here](https://leetcode.com/discuss/interview-question/541791/google-phone-min-cost-max-path-from-root-to-leaf)).\n\nAs you can see, there are questions that are not even in LC (first one I cant even find online). Answering those kind of questions in half hour is time consuming, tiring and stressful but also fun in a different way. In some way, it felt more like brainstorming.\n\nMy recommendation is to use LC to prep, but to not totally depend on it. Read technical blogs/books, watch youtube videos on system design and how distributed systems work (like gossip protocol, distributed transaction, distributed lock etc.)\n\nOverall, I felt the interview went well but it didn\u2019t result into an offer. But there\u2019s no way to know why I fell short exactly. I can either waste time speculating or keep grinding more. I\u2019m going for the latter and going to go hard for the next few months.\n\nWishing everyone all the best for upcoming interviews if you have any and if you dont, hope you get one soon. Also, this probably applies to everyone across the world, but stay inside your home and be safe.

YOE: 5 years this summer\nBSCS\n\nApplied through a hiring platform and a recruiter from Amazon reached out. Started with OA and once completed, I was told the 