Microsoft

Focus on Data Structures and Algorithms. Knowledge of BSTs, stacks, and hash tables is essential. Graph Algorithms and Dynamic Programming are covered too. I was asked a question on Topological sorting (implement it with and without stacks) and an

I applied through a recruiter. After a brief introduction on both sides, I was asked to do a design for a multiplayer Tic-Tac-Toe game. The interview developed in a collaborative way with the interviewer. The interview took about 30 minutes.

OA and 2 technical interviews. The OA was pretty easy, and the interviews were average. However, I have grinded LeetCode before, so it might be harder for the average person.