I applied through college or university. The process took 4 weeks. I interviewed at Microsoft (Seattle, WA) in Apr 2010
Interview
I began the interview process after meeting with a Microsoft recruiter at my university. Within a few days, I had a phone interview scheduled. I had two of these and they were very, very easy; if you cannot make it past the phone interviews either you didn't get anything out of school or Microsoft doesn't want you.
I was then invited to fly up to Bellevue, WA to interview for the Bing! team. I had to solve whiteboard problems in front of five different team members. I felt that some of the interviewers were somewhat disrespectful - one guy pulled out his laptop as I was solving/explaining a problem. I also had a lunch interview with some kind of manager that went pretty awkwardly. The guy didn't say much and I didn't have much to tell him since he was pretty closed off. I thought I did well overall except for an interview question where they asked me to implement a Sudoku solver.
Process: 3 virtual interviews in a single day (75 minutes each) via MS Teams and HackerRank.
Overall Experience: Positive, highly technical, and deeply focused on data structures, optimization, and system design.
Interview questions [1]
Question 1
Round 1: Project & Architecture Review (75 mins)Focus: Deep dive into past technical experience.Details: The entire round was dedicated to presenting a personal/academic project. The interviewer asked detailed questions regarding the system's architecture, specific algorithmic choices, trade-offs, and design decisions.Round 2: Coding / Algorithms (75 mins)Focus: Problem-solving, bitwise operations, and array manipulation.Questions Asked:Bitwise Operation (LeetCode 2275 - Largest Combination With Bitwise AND Greater Than Zero): Given an array of integers, find the size of the largest subset where the bitwise AND of all elements is greater than zero. Insight: Count the number of set bits (1s) at each of the 32 bit positions across all numbers.Frequency Tracking (LeetCode 169 - Majority Element): Given an array, find the element that appears at least $n/2$ times (guaranteed to exist). Can be solved using a Hash Map ($O(n)$ space) or optimized using the Boyer-Moore Voting Algorithm ($O(1)$ space).Round 3: Low-Level Design (LLD) (75 mins)Focus: Object-Oriented Design (OOD) and data structure integration.Details: Design a parking lot system. The core challenge evolved into choosing the optimal combination of data structures to achieve $O(1)$ efficiency for parking, leaving, and tracking the physical index of each vehicle.Key Solution Concept: Integrating a Fixed-size Array (to maintain physical indices), a Doubly Linked List (to manage the pool of free spots), and a Hash Map (to map vehicle IDs to list nodes).
3 rounds of leetcode medium, 2 questions were very easy, the last one was really hard (it was a binary tree question). They asked about space and time complexity. In terms of structures it was straight forward but the question itself was hard
Behavioural round consisted of "Tell me about yourself and why you wanna work for microsoft and resume screening. And technical interview consisted of 2 LC question 1 medium and 1 easy.
Top companies for "Compensation and Benefits" near you
