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.

First, there was an OA. The questions in the OA were from mid to hard. After that, I cleared the OA. Next, there was a technical round in which the interviewer asked me about core CS fundamentals and some DSA-related questions.

It went great. The interviewer was friendly and gave hints. I was able to solve all the questions. They asked some CS fundamental questions. I also asked the interviewer some questions and was satisfied by his replies.