Microsoft Software Engineer interview questions

3 phases. Interview with outsourced recruiter, then 2 technical calls. It was all In english. At the meeting was used screen sharing to resolve assigned logical tasks. Pleasant atmosphere. It was pretty quickly resolved.

Asked about past experience and resume. Questioned on my experience on large-scale distributed system and thought it's not "large" enough. Other questions are normal BQ. Came to the coding part at half-way for a 45-min tech screen. I have a bad feeling when he said coding as the remaining time is not long. The coding question is, given a valid BST, a target value and a target distance k, find all nodes having a distance k with the node having the target value in the BST, both parent and child nodes count, disregard for output order. I spent the rest of time but didn't work this out. After looking up afterwards this seems to be a mid-to-hard lc problem. I don't think 20 min would be enough to come up with the correct solution and code for anyone who's not lc pro..