Microsoft

One online assessment, followed by two rounds of technical interviews. During the interviews, standard questions were asked. It would be good to revise linked lists, binary trees, and other algorithms. For the second interview, OOPS questions were

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.

Easy questions only. DSA basic discussion on projects. Two-round interview, no HR round. Nice package, good work-life balance. Palindrome substring, LeetCode. Solve all problems. No system design. Chill.