Microsoft L61 | In person drive | Accepted

microsoft logo
microsoft
4 yearsOffer
August 27, 202534 reads

Summary

I recently completed an interview process at Microsoft for an L61 position within the SharePoint team and successfully received an offer. The interview included a mix of Data Structures & Algorithms, System Design, and an As Appropriate (AA) behavioral round.

Full Experience

I had an engaging interview experience at Microsoft, spanning multiple rounds, culminating in an offer. Here's how it unfolded:

Round 1: Data Structures & Algorithms + Resume

This round began with a Data Structures & Algorithms problem where I had to solve Populating Next Right Pointers in Each Node. Following that, the discussion shifted to my resume, where I elaborated on my past projects and experiences. The interviewer also asked me some specific questions related to C#.

Round 2: Data Structures & Algorithms

The second DSA round presented two problems. First, I tackled the Bottom View in Binary Tree problem. The second problem was a more straightforward hashmap question that required me to find the maximum occurring element from a given input. After successfully completing the DSA questions, we had a brief non-technical chat.

Round 3: High-Level Design (HLD)

This was a System Design round where I was challenged to design an autocomplete system, similar to what Bing uses. The interviewer was particularly interested in how I would handle a large volume of requests and scalability aspects. The discussion then delved into the CAP theorem, and while there was initial disagreement on my reasoning for prioritizing availability over consistency, we eventually reached a consensus.

Round 4: As Appropriate (AA) Round

The final round, the AA round, typically focuses on the candidate's perceived weakest interview performance. For me, this was the design round. I was asked a trivial question related to a Parking Garage System, which I found easy to answer.

Approximately 2-3 days after completing all rounds, I received an offer from Microsoft.

Interview Questions (5)

Q1
Populating Next Right Pointers in Each Node
Data Structures & AlgorithmsMedium

I was asked to solve the problem of connecting next right pointers in each node of a perfect binary tree.

Q2
Bottom View in Binary Tree
Data Structures & AlgorithmsMedium

I was tasked with implementing the bottom view of a binary tree.

Q3
Maximum Occurring Element
Data Structures & AlgorithmsEasy

The interviewer presented a basic hashmap question where I needed to find the maximum occurring element in a given input.

Q4
Design Autocomplete System
System DesignHard

I was asked to design an autocomplete system, specifically considering a scenario similar to Bing's autocomplete functionality, and discussing how to handle a large number of requests and ensure scalability.

Q5
Parking Garage System Design
System DesignEasy

In the AA round, I was presented with a design question related to a Parking Garage System, which was described as a trivial problem.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!