Status: New grad, B.ASc, Top 25 CS school
Position: SDE New Grad at Microsoft for Azure team
Location: Redmond, WA
Date: September 19, 2019

Phone screen:

• behavioural questions
• one algorithm problem (explain over phone, no code): https://leetcode.com/problems/merge-sorted-array/

The very next day, I was invited onsite on a date of my choosing (Sept. 6, Sept. 19, Oct. 2, etc).

Onsite (4 rounds):
Microsoft provided rental car for me to drive to Redmond (because flying from Vancouver is pointless) and hotel for 2 nights in Bellevue. I was given $75 USD per day in food expenses

The day started with sign in by 11:30AM at Microsoft Recruiting building. You get to meet all the other interviewees. Lunch cards for up to one time use of $10 USD in their subsidized cafeteria provided. Interviews started at 1:00PM and ended at 5:00PM.

They were short on interviewers so some people like me only had 3 rounds. All rounds were 45 min each, with 15 min break between rounds. Each round started with 1-2 behavioural questions such as "tell me a project you're most proud of" and then whiteboard technical questions. After the interviews, they gave a microsoft hoodie and coupon for Microsoft store that gives you a certain percentage discount on some products.

• Round 1:

  • implement a Queue
  • focus on enqueue and dequeue
  • up to you how to implement it, but its a conversation with the interviewer the entire time about design choices
  • https://leetcode.com/problems/design-circular-queue/

• Round 2:

  • build binary tree from a preorder traversal list (leaf nodes values are denoted with '#')
  • eg. [A,B,#,#,C,#,D,#]
  • similar to https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/

• Round 3 (skipped)

• Round 4:

  • Find all values of x which make this statement true ( x & (x-1) ) == 0
  • Given lists A, B, C code the following without using library functions/data structures: A union B intersect C
  • https://leetcode.com/problems/continuous-subarray-sum/