Microsoft

First, there was an Online Assessment. After cracking the coding round, one question was related to Kadane's algorithm. The second question was related to finding local minima in a grid. I did it in O(N) time complexity and O(log n) space complexity.

I applied through college or university. The process took 2 weeks.- First round: There was one DSA round with a stack-based DSA question. It was easy to medium, and it was mostly about a monotonous stack. They also asked computer science fundamentals

The interview process included: * One online test with 3 problems to solve in 1.5 hours. * Three interview rounds, each with 2 DSA problems to solve in 1 hour. The problems were all from GeeksforGeeks and were pretty standard.