Microsoft

That was on campus. It took one and a half hours and two rounds of interviews. The OA was somewhat average to difficult, but the interview was not quite that difficult. The second round was a resume round.

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 process took one day. It was for a data engineer role. I got it without a referral. People at Microsoft were saying it was internal and they were not able to give a referral. The position was not finalised. I got a call from an HR representative