Writing directly about the 3x45 minutes rounds.

1. Amazon employee with 5 YoE.

LC : Given a list of words find the k maximum frequently occuring words.
If frequency is same then sort by alphabetical order.

LP : How do you work in a hard deadline ?
How do you prioritize the work given to you ?

2. Amazon employee with 5 YoE.
   LC : implement a data structure where insertStart,insertEnd,insertMiddle,deleteStart,deleteEnd,deleteMiddle in O(1).
   I used a Doubly linkedList.

LP : Tell me about a time where you took some extra responsible to complete the work ?

3. 2D matrix where rows containing 0s and 1s were in descending order.
   Find the row with maximum sum and the row number.

I was able to solve the questions. I might have messed up in the LP questions.