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.

The Microsoft SDE interview process involved an initial online assessment focused on data structures and algorithms, followed by multiple technical interview rounds. These rounds tested my problem-solving skills, coding proficiency, and understandin

It is very hard and very easy at the same time. It depends on the person. All the best. Work hard, and you will definitely crack the interview. All the best. Best of luck.