**Round 0**\nMicrosoft came to my university and before calling for on-site interviews (this was for summer internship), they had a round where mostly my interests and previous experiences and projects in Software Engineering were discussed. (I had around 3 years of work ex prior starting Masters)\n\n---------------------------------\nThen I was called for on-site interviews towards November end.\nThere were 4 rounds, each round was 45 mins.\n\n**Round 1:**\n* https://leetcode.com/problems/rotate-image\nFollow-up: What if the image was a rectangle instead of a square?\n\n**Round 2:**\n* https://leetcode.com/problems/remove-k-digits\n* After solving this I was asked a pretty straightforward question, just that it had a lot of edge cases. \nSo the question was, if we have a screen let\'s say for eg 500x500 and then we have a lot of open "windows" like when we have in a classic GUI setup in Windows OS, what\'s the smallest rectangle that covers all those windows. You can imagine cases like where one window is hanging outside of the 500x500 screen (as in some part is within screen and some is outside). \n\n**Round 3:**\n* How would you detect a deadlock when ```n``` threads are competing for various resources. It boiled down to the cycle detection problem in a graph. I had to write code for that.\n\n**Round 4:**\n* This was a behavioral interview. Just checking for whether I would be a good fit.\n\n---------------------------------\n*Fast forward to the summer internship*\n\nSo I interned in a team, but there was an internal team change option this summer (2019), where you could apply to a team of your choice and then just give 1 interview and move to that team, when joining next year. \n\nSo I interviewed with another team and it was an 1 hour interview.\n\n**Round 1:** (Aug 2, 2019)\nMajorly discussed one of the class projects which involved a recommendation system and implementing that optimization problem in PyTorch. \n\nThen 2 questions were asked\n1. Sort numbers in an array such that even numbers come first and then odd numbers and both even and odd numbers should be internally sorted in descending order. I was asked to write a one-liner comparator in Java (the language of my choice for this interview)\n2. [Math Question] Let\'s say you have two sets A with 5000 elements and B with 8000 elements, A \u2229 B contains 500 elements. Let\'s say we randomly sample 500 elements from set A, name it A\' and randomly sample 800 elements for set B, name it B\' . What is the expected number of elements in the set (A\' \u2229 B\') ?  \n\n---------------------------------\nFinally I was offered a L60 position. I have linked the compensation here. \nhttps://leetcode.com/discuss/compensation/364663/microsoft-sde1-l60-bellevue-wa\n\nAs far as the title of the post I was confused whether to write \n\nMicrosoft | Intern | Redmond | December 2018 [Offer]\n\nor \n\nMicrosoft | SDE1, L60 | Bellevue | August 2019 [Offer]\n\nI hope you get my point. None the less, that was my interview experience.

Round 0\nMicrosoft came to my university and before calling for on-site interviews (this was for summer internship), they had a round where mostly my interests 