I got referred for a SDE-2 position at Microsoft.

Round 1 :

1. Reverse a linkedlist -> Suggested stack and recursion approach but interviewer wanted iterative so did that.
2. Reverse alternate nodes -> missed a simple case here which interviewer pointed (negative points for that).
3. Reverse alternate k nodes -> extension to top problem so easily done.
4. Possible testcases for the above problem

Round 2:

1. Inorder of tree without recursion - used stack
2. Implement a hashmap - i could only think of O(n) get and put here - RIp my chances to go any further.

I hope this helps someone. Probably check your interview bandwith for camera to work before the interview as they go crazy (Mine asked if had another tab open even when i had shared my whole screen)