Microsoft Software Engineer Onsite Coding Questions

For Microsoft Redmond location- 1. Implement Queue using Stacks: https://leetcode.com/problems/implement-queue-using-stacks/ 2. Spiral Matrix: https://leetcode.com/problems/spiral-matrix/ 3. Find Winner on a Tic Tac Toe Game: https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/ 4. LRU Cache: https://leetcode.com/problems/lru-cache/

Find the lowest common ancestor of a binary tree which has links to its parents. It is a variation of this question: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ public class TreeNode { int val; TreeNode left; ...

Design a directory class which has properties like Subdirectory, Files etc and FileLinkPath. Write a function Copy Directory that gets the src directory and filePath as input. Please ensure that the filelinkpath...

With given coordinates of the points x1,y1 and x2,y2 draw a line between the points. For simplicity assume both the points lie in first quadrant. Would anyone like to discuss how...

## Coding: Implement K-Means Clustering Given `n` 2D points `points[i] = (x_i, y_i)` and a number of clusters `k`, implement k-means and output the cluster label for each point. ### Task Implement s

### Problem Overview - Task: maximize the number of different cars produced in a month using two assembly lines with limited hours. - Input: array H where H[K] is hours for car K, and integers X and Y

Hey guys, I have a 4 round interview coming up for Software Engineer role in the Foundry team. Has anyone here completed the loop before for the core AI org? I would love to hear from anyone who’s gon

Hi, I completed my full loop for Microsoft on March 25 and still haven’t heard back even though the HM said they are trying to hire fast and asked how soon I would be available. Status on portal still

Location : USA I received feedback from the Microsoft recruiter indicating that my interview loop received positive feedback. Although the specific position I interviewed for has been filled with anot

This post was last edited by Anonymous on 2025-09-23 19:56. Implementation of the Rate Limit Algorithm 💊雾尔 物伞雾 A round of behavioral questions + introduction of my project. I applied for a long time,

windows组招，3轮面试，有很多反向Q&A时间 第一轮：面试官自己出的题，given an integer grid and a circle diameter, mark the integers within the circle diameter and return the updated grid. 第二轮：rate limiter，followup是without changing

Posting my roommate's interview experience from last month. Finding a job in under 5 years is so difficult. She finally got an interview but failed. She's short on points, so please be lenient. The fo

I completed three strong technical rounds for Microsoft, achieving ratings of "Strong Hire" in the first two (DSA/LLD and System Design) and "Hire" in the third. However, during the final AA techno-be

**Application and Initial Screening** Following an application via the Microsoft Career Portal for a role on the Azure team, the process began with a recruiter screen and a HackerRank test. Both codin

**Microsoft Hiring Drive (October 31st)** **Round 1: Coding** Two Data Structures and Algorithms questions were asked: 1. **Max Consecutive Ones III:** Find the maximum number of consecutive 1s in a b

I recently completed the Microsoft interview process, which consisted of one HackerRank Online Assessment followed by three one-on-one rounds covering coding, system design, and behavioral topics. Alt

**Date:** November 7, 2025 **Experience:** 4.5 Years **Structure:** 4 Rounds (3 consecutive, 1 separate) **Verdict:** Selected **Round 1: Coding** * **Problem:** Design a "PhotoCache," functioning as

A recruiter scheduled two interview rounds for Friday, November 28th, with a potential third round listed as an "AA round: real time allocation" pending. **First Round** The session focused on a singl

The whole process took 8 weeks After finishing the OA(need to solve 3.5/4 ques) Week1: DSA Screening: Was Asked a Leetcode Hard Ques on Quad Tree got positive feedback and was passed to the Onsites We

Given cities n from 0 to N-1 in a doubly link manner, also given number of amenities m (0 to m-1 for each city). Also, given a matrix amenities of...