Microsoft Interview Experience (3+ YOE)

Anonymous13h ago

I recently appeared for the Microsoft interview process for a position requiring 3+ years of experience.

Sharing the questions and my experience from each round.

Round 1: Hiring Manager + System Design

The first round started with a discussion about my background and professional experience.

For around 50 minutes, the interviewer asked about:

  • My resume and previous projects.

  • My current responsibilities.

  • The technical decisions I had made in my projects.

  • My overall work experience.

After that, moved to a system design question, which lasted approximately 30 minutes.

I started with a basic design for a single client and gradually expanded it by discussing:

  • Load balancing.

  • Horizontal scaling.

  • Database sharding.

  • Handling increasing traffic.

The interviewer felt that my theoretical understanding was good but expected more practical depth and implementation-level clarity for the experience level required for the role.


Round 2: Object-Oriented Design (OOD)

This round had two parts and focused on designing and implementing an attack-path analysis system.

Part 1: Design an Attack Path System

Asked to design a system that could represent attack paths across different infrastructure components.

The main entities included:

  • Node: Contained an ID, name, and criticality.

  • VirtualMachine: Extended Node and included an internet-connectivity property.

  • Database: Extended Node and included a flag indicating whether it contained sensitive data.

  • Edge: Represented a connection between a source and target node, with its own criticality.

  • AttackPath: Contained a collection of nodes and edges along with an overall severity.

I discussed the class relationships, responsibilities, and how these entities would work together.

The interviewer mentioned that there wasn't one fixed or correct design and seemed satisfied with the approach.

Part 2: Implement the Attack Path Logic

Next, I was asked to implement a function that could validate and construct an attack path using the given nodes and edges.

I explained my proposed algorithm with an example and started implementing it. However, I couldn't complete the implementation within the available time.


Round 3: Data Structures & Algorithms

This was a 60-minute coding round with three questions.

Question 1: Maximum Consecutive Ones After K Flips

Given a binary array, find the maximum number of consecutive 1s possible by flipping at most K zeros.

Approach: I used the sliding window technique with two pointers. I expanded the window while keeping track of the number of zeros. Whenever the count exceeded K, I moved the left pointer until the window became valid again.

  • Time Complexity: O(n)

  • Space Complexity: O(1)

Question 2: Minimum Time to Burn a Binary Tree

Given a binary tree and a target node, find the minimum time required to burn the entire tree if the fire spreads to adjacent nodes every second.

Approach: I used BFS after first identifying the target node. Since the input nodes already had parent pointers, I could traverse in all three directions: left child, right child, and parent.

A visited set prevented revisiting nodes, and each BFS level represented one unit of time.

  • Time Complexity: O(n)

  • Space Complexity: O(n)

I completed the implementation, and the interviewer confirmed that the solution was correct.

Question 3: Message Filtering Within a K-Second Window

Given a list of messages with timestamps and a time window K, return a boolean array indicating whether each message should be accepted or suppressed.

A message should only be accepted if it hasn't been accepted within the previous K seconds.

Approach: I used a hash map to store the timestamp of the last accepted occurrence of each message.

For every incoming message:

  • If it hadn't appeared before, I accepted it.

  • If the difference between the current timestamp and its last accepted timestamp was at least K, I accepted it.

  • Otherwise, I suppressed it.

The important detail was to update the timestamp only when a message was accepted. If the requirement were to track every occurrence instead, the timestamp update logic would need to change.

  • Time Complexity: O(n) expected

  • Space Complexity: O(m), where m is the number of distinct messages.

I completed all three coding questions comfortably within the round.

Final Outcome: Rejected

Although I was able to solve all three DSA questions and received positive feedback on the OOD design discussion, I couldn't complete the implementation in the second round. The feedback from the first round also indicated that I needed more practical depth in system design.

Overall, it was a good learning experience.

Recommended Reads

Post

Bounce Daily Is Hiring Software Developer Interns!

Job Details Company: Bounce Daily Role: Software Developer Intern Opportunities: Internship and Software Development Engineer Stipend: Competitive Location: Not

Interview Experience

Decentro SDE-1 Interview Experience | 3 YOE | Rejected

Recently interviewed for the SDE-1 role at Decentro. I have around 3 years of experience, and the interview process had three rounds. Sharing the questions I re

Post

My Deloitte Offer

Hi everyone, I recently received an offer from Deloitte and wanted to share the details here to get some feedback from the community. My Profile Experience: 5 y

Post

Apple Is Hiring Junior SDET Engineers in Bengaluru!

Apple is looking for a Junior Software Development Engineer in Test to join its Sales Engineering team. The role focuses on software quality, test automation, A

Interview Experience

LinkedIn IC2 Apps Interview Experience

Got an opportunity to interview for the IC2 Apps role at LinkedIn. Sharing the questions and a few things I learned along the way. Phone Screen Round The round

Comments0