- Published on
Microsoft Senior Software Engineer | Hyderabad | 25th May | Reject
- Author
- Shared Anonymously
Microsoft interview online on 25th May drive. Gave OA a week before that.
Round 1 - OA (70 mins):
https://leetcode.com/discuss/interview-question/5194349/microsoft-codility-oa-2024-may/2417550
Round 2 - Online interview (1 hr):
Discussion on projects in current organisation - We went over my current projects and discussed how we designed the current project and if there was something I would like to highlight in it. Then he gave me,
https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/. I implemented it but was stuck due to printing the node.val instead of node.left.val and node.right.val in this problem. Solved it after I observed it and ran the test cases suggested by the interviewer.
Round 3 - Online interview 1(hr):
Started with how I checked performance improvement in my current project development, what tools we used to evaluate it and so on. Later he asked me to give a LLD of tic tac toe game. Interviewer seemed more focused on getting the winner in O(1) time here. I gave a solution but he did not seem convinced that calling to check if a winner exists after each move will not be O(1) because the size of the grid for tic tac toe is 3x3 always.
Verdict:- Rejected.