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 only had one round, which was conducted virtually on MS Teams. The interviewer started off by asking me for a brief introduction, the projects I had done, and how I spent my college days. I was asked what language I was comfortable with (C++). H

1. Coding question - 2, time: 1 hr 2. Online interview - DS algo 3. Online interview - DS algo - trees 4. Design questions DS algo covered: trees, arrays, and strings are enough to crack Microsoft.