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

Proper process and timely interviews. The interview was of average difficulty, and related questions were asked. Easy process.

There were rounds. Round zero was an online coding test with 2 questions. First round was a group fly after resume shortlisting. The rest three were technical interviews. The last round also had some HR questions asked. Most of the questions we