Status: 6+ YOE
Position: SDE2 at Amazon
Location: India
Date: July 2020

I recently started my journey to experience what FAANG interview is like.
Cant share exact questions due to NDA most of the questions are on LC.

OA: 2 question, easy and medium level
https://leetcode.com/discuss/interview-question/411357/
https://leetcode.com/problems/partition-labels/
1st Technical Virtual Onsite (1 hour):
- Behavioral questions LP
- 2 Algorithm question.
- Standard BFS problem
- Binary tree to DLL conversion
2nd Technical Round(45 min):
- LP's
- 3 Algorithm question
- https://leetcode.com/problems/binary-tree-maximum-path-sum/
- https://leetcode.com/problems/next-greater-element-ii/
Design
- System design question- Design Stock trading System
HM Round
- Lots of LP and previous project discussion
Bar Raiser
- Lots of LP and one Hard Algorithm problem, not on LC .
Problem was related to suffix tree. I gave DP solution of O(n2). he wanted in O(N). I never thought i will get a problem on suffix tree.

Result: Got feedback from recuriter, they could not proceed with my profile currently.
I did extremely well in LP and design. I was able to come with optimal solution for all my coding question except the last one.
As per recuriter what costed me the offer was my code was not of "production quality".

Advice: Practise on paper or notepad. Do not get used to IDE.

Cheers.
I have another go at FAANG with facebook next week. Wish me luck :)