I had a referral and within 2 weeks of the referral, a Recruiter contacted me via email for 1st round 30-min Phone Screen.

1. Complexity of searching in a AVL/height balanced tree?

Ans : O(logn) - Please explain how you come to the conslusion of O(logn)

2. How would you find the intersection of two linked lists.

Ans: https://leetcode.com/problems/intersection-of-two-linked-lists/
Again, explain as much as you can over the phone. Walk him through your thought process.

3. Remove duplicates from a Sorted Linked List.

Ans: https://leetcode.com/problems/remove-duplicates-from-sorted-list/
Explain your process again.

4. A couple of behavioral and past work experience based questions.

Why do you want to work for microsoft is a MUST.

My interview went well. Waiting for next steps.