Upload Button Icon Add office photos

Microsoft Corporation

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Clear (1)

Microsoft Corporation Software Developer Interview Questions, Process, and Tips

Updated 1 Jan 2025

Top Microsoft Corporation Software Developer Interview Questions and Answers

  • Q1. Buses Origin Problem Statement You have been provided with an array where each element specifies the number of buses that can be boarded at each respective bus stop. Bus ...read more
  • Q2. Chess Tournament Problem Statement In Ninjaland, a chess tournament is being organized with C chess players attending. They will all stay in a hotel that has N available ...read more
  • Q3. Day of the Week Calculation Your task is to create a function that determines the day of the week for any given date, whether in the past or the future. Input: The first ...read more
View all 131 questions

Microsoft Corporation Software Developer Interview Experiences

62 interviews found

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Spiral Order Traversal of a Binary Tree Problem Statement

    Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.

    Example:

    Input:
    The binary tree is represented i...
  • Ans. 

    Print nodes of a binary tree in spiral order traversal.

    • Use a queue to perform level order traversal of the binary tree.

    • Alternate between printing nodes from left to right and right to left at each level.

    • Handle null nodes represented by '-1' appropriately.

    • Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Word Break Problem Statement

    You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.

    The strings from A c...

  • Ans. 

    Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.

    • Iterate through all possible combinations of strings from the list to form the target string.

    • Use recursion to try different combinations of strings.

    • Check if the current combination forms the target string.

    • Return true if a valid combination is found, otherwise return false.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. Design an elevator system.
  • Ans. 

    Design an elevator system for efficient vertical transportation.

    • Divide building into zones to optimize elevator usage.

    • Implement algorithms for efficient elevator scheduling.

    • Include safety features like emergency stop buttons and overload sensors.

    • Consider user interface for passengers to select floors and monitor elevator status.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaNoMicrosoft interview preparation:Topics to prepare for the interview - Data structures, algorithms , low level system design , high level system design, problem solvingTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Never give up
Tip 2 : Practice 
Tip 3 : Be positive

Application resume tips for other job seekers

Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Pretty easy questions.

  • Q1. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in an array of distinct integers.

    • Sort the array and return the element at index K-1.

    • Use a min-heap to find the K-th smallest element efficiently.

    • Implement quickselect algorithm for optimal performance.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 20 Minutes
Round difficulty - Easy

1 coding question

  • Q1. 

    IP Address Formation from String

    Given a string S consisting only of digits from 0 to 9, your task is to find all potential IP addresses that can be formed from S and list them in lexicographical order. I...

  • Ans. 

    Given a string of digits, find all potential valid IP addresses that can be formed from it.

    • Split the string into four parts and check if each part is a valid IP segment (0-255).

    • Use backtracking to generate all possible combinations of valid IP addresses.

    • Ensure that the IP address does not contain leading zeroes.

    • Return the valid IP addresses in lexicographical order.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

Total Discussion on OS concepts

  • Q1. Can you explain the concepts related to memory management in operating systems?
  • Ans. 

    Memory management in operating systems involves allocation, deallocation, and optimization of memory usage.

    • Memory allocation: OS allocates memory to processes based on their requirements.

    • Memory deallocation: OS frees up memory when it is no longer needed by a process.

    • Memory optimization: OS optimizes memory usage through techniques like paging, segmentation, and virtual memory.

    • Examples: Paging in which memory is divide...

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

Easy in office environment

  • Q1. 

    Find the Lone Set Bit

    Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer N. The representation contains exactly one '1' and the rest are...

  • Ans. 

    Find the position of the lone '1' bit in the binary representation of a given non-negative integer.

    • Iterate through the bits of the integer to find the position of the lone '1'.

    • Use bitwise operations to check if there is exactly one '1' bit in the binary representation.

    • Return the position of the lone '1' or -1 if there isn't exactly one '1'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria7 CGPAMicrosoft interview preparation:Topics to prepare for the interview - Trees, graphs, dynamic programming, stacks, queuesTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Do a good project.
Tip 2 : Master the topics you are preparing.

Application resume tips for other job seekers

Tip 1 : Avoid writing things you do not know
Tip 2 : Follow a proper format for Resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 45 minutes
Round difficulty - Medium

It was an online round hosted on cocubes. It consisted of 3 coding questions only and the duration of the test was 45 mins. 
The test link with a unique id and password was sent to the email 1 day prior to the test day. It consisted to platform specification, sample test etc.

On the day of test, we were given a time slot of 5pm - 11pm. We could attempt the test as per our comfort.
The instructions were pretty straightforward and we could attempt it from anywhere. 

There were only 2 requirements. A webcam must be available. And a decent internet. 

About the Platform. 
In all of the problems base classes and code were disabled, we needed to implement only certain classes/ functions. Clipboard copy was blocked, tab switching was not allowed and rest the platform is very basic and simple.

  • Q1. 

    Add Two Numbers Represented by Linked Lists

    Given two singly linked lists, each representing a positive number without leading zeros, your task is to add these two numbers. The result should be returned a...

  • Ans. 

    Add two numbers represented by linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry.

    • Create a new linked list to store the sum.

    • Handle cases where one linked list is longer than the other.

    • Update the next pointer of the current node to point to the new node with the sum.

    • Handle the carry if it exists after reaching the end of both linked lists.

  • Answered by AI
  • Q2. 

    Maximum Subarray Sum Problem Statement

    Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) that yields the maximum sum among al...

  • Ans. 

    Find the maximum sum of a subarray in an array of integers.

    • Iterate through the array and keep track of the maximum sum subarray ending at each index.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Consider the case where all elements are negative, in which case the maximum sum would be the largest negative number.

  • Answered by AI
  • Q3. 

    Sum of Leaf Nodes at Maximum Level Problem Statement

    Given a binary tree of integers, your task is to calculate the sum of all the leaf nodes which are present at the deepest level of the binary tree. If ...

  • Ans. 

    Calculate the sum of leaf nodes at the deepest level of a binary tree.

    • Traverse the binary tree to find the deepest level.

    • Keep track of leaf nodes at the deepest level and calculate their sum.

    • Handle null nodes represented by -1.

    • Ensure the sum fits in a 32-bit integer.

  • Answered by AI
Round 2 - Group Discussion 

Round duration - 60 minutes
Round difficulty - Hard

This round is known as the group fly round. After clearing the first round, we were called at the Microsoft Gurgaon office for the face to face interviews. Approximately, 60 students were there on the day I was called. I guess there were multiple days for multiple slots.

We all were divided into groups of 6-8 people and were called inside a round table room with 1 interviewer. This round consisted of 1 problem only to be discussed over with the interviewer. And the solutions to be written on pen paper. 

The key here is to walk through the thought process and the steps with the interviewer. He will go around the table and will have discussion with each one of us and discuss about the pros, cons of the solutions.

It is advisable to ask as many questions as possible, to gather requirements and to be sure what are the expectations.
 

Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was the first face to face round. 
It was held just after the group fly. From my group fly slot, 2/7 were selected. 
The interviewer made me comfortable, we started informal talks about college and hobbies. 

It kicked off with some basic discussion of the previous round problems, he had some questions about the encryption and security related stuff from payment scenario. 

Then there were some behavioral questions and lastly there were a couple of whitepaper coding questions.

  • Q1. 

    N-Queens Problem Statement

    Given an integer N, your task is to position N queens on an N x N chessboard in such a way that no two queens threaten each other.

    A queen can attack other queens that are in t...

  • Ans. 

    Position N queens on an N x N chessboard so that no two queens threaten each other.

    • Use backtracking to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure no two queens threaten each other.

    • Display all valid configurations found.

  • Answered by AI
  • Q2. 

    Left View of a Binary Tree Problem Statement

    Given a binary tree, your task is to print the left view of the tree.

    Example:

    Input:
    The input will be in level order form, with node values separated by a...
  • Ans. 

    Print the left view of a binary tree given in level order form.

    • Traverse the tree level by level and print the first node of each level (leftmost node).

    • Use a queue to keep track of nodes at each level.

    • Time complexity should be O(n) where n is the number of nodes in the tree.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

This was the second face to face. Almost 50% students were selected from the first face to face round. 
This was very straightforward round, a hectic day and it was already late by now. 
The interviewer started with formal introduction and gave me 2 very basic problems to code. 

This code consists of writing the entire code from scratch on whitepaper, with unit tests that can cover almost all scenarios. Some sample test cases were given by the interviewer at the end, to validate and dry run my solution.

  • Q1. 

    Cycle Detection in a Linked List

    Determine if a given Singly Linked List of integers forms a cycle or not.

    Explanation:

    A cycle occurs when a node's next points back to a previous node in the list. This...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • If one of the pointers reaches the end of the list (null), there is no cycle.

  • Answered by AI
  • Q2. 

    Maximum Path Sum Between Two Leaves of a Binary Tree Problem Statement

    You are provided with a non-empty binary tree where each node has a non-negative integer value. Compute and return the maximum possib...

  • Ans. 

    Find the maximum path sum between two leaves in a binary tree.

    • Traverse the binary tree to find the maximum path sum between two leaves.

    • Keep track of the maximum sum encountered during traversal.

    • Consider all possible paths that include leaf nodes.

    • Handle cases where there is only one leaf node or no leaf nodes.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was the final round. 
It was very late in the evening, around 10pm. 
The interviewer here was one of the senior manager in the org (M2). 

This kicked off with very informal conversations and introductions. 
The interviewer was very engaging.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaMin 7.5 CGPA was requiredMicrosoft interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Designs, Operating Systems, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be solid with the basics of Ds, Algo. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer

Application resume tips for other job seekers

Tip 1 : Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2 : Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3 : It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Hard

Online coding contest, focus on DP and trees

  • Q1. 

    Chess Tournament Problem Statement

    In Ninjaland, a chess tournament is being organized with C chess players attending. They will all stay in a hotel that has N available rooms. Each player will choose one...

  • Ans. 

    Assign rooms to chess players to maximize overall focus level by minimizing distance between rooms.

    • Sort the positions of rooms in ascending order.

    • Calculate the distances between adjacent rooms.

    • Select rooms with minimum distances to maximize overall focus level.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Hard

It was conducted on the GHCI conference itself. It was held in a Microsoft interview room at the career fair of the conference. This was primarily based on my coding abilities and understanding how to optimise a solution

  • Q1. 

    Check Word Presence in String

    Given a string S and a list wordList containing N distinct words, determine if each word in wordList is present in S. Return a boolean array where the value at index 'i' indi...

  • Ans. 

    Given a string and a list of words, check if each word in the list is present in the string and return a boolean array.

    • Iterate through each word in the wordList and check if it is present in the string S.

    • Use a boolean array to store the presence of each word in the string.

    • Remember that the presence of a word is case sensitive.

    • Do not use built-in string-matching methods.

    • Return the boolean array without printing it.

  • Answered by AI
Round 3 - Face to Face 

Round duration - 30 minutes
Round difficulty - Medium

This was a system design round.

Round 4 - HR 

Round duration - 20 minutes
Round difficulty - Easy

This was the HR round and only typical HR questions were asked.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in HyderabadEligibility criteriaCV shortlistedMicrosoft interview preparation:Topics to prepare for the interview - Data structures and algorithms, trees, dynamic programming, operating systemTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practice implementation of code end to end
Tip 2 : CV should have many projects and published paper to be shortlisted
Tip 3 : Focus on optimization 

Application resume tips for other job seekers

Tip 1 : Include projects in your resume.
Tip 2 : Keep resume of one page, but utilize the entire page efficiently

Final outcome of the interviewSelected

Microsoft Corporation interview questions for designations

 Software Developer Intern

 (24)

 Software Developer II

 (3)

 Senior Software Developer

 (2)

 Developer

 (1)

 Software Engineer

 (65)

 Software Engineer2

 (7)

 Software Intern

 (1)

 Lead Developer

 (1)

Interview Questionnaire 

4 Questions

  • Q1. Given a compact data structure to store strings sequentially, one byte stores length l of the string, next l bytes contain the string characters. Write a code to insert the given string at the ith place, m...
  • Ans. 

    The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.

    • To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.

    • We can use a loop to iterate through the data structure and find the ith position.

    • After finding the ith position, we can calculate the new length of the data structure and allo...

  • Answered by AI
  • Q2. How will you construct parse tree for ((a+b)*c)/d? what all data structures can you use?
  • Ans. 

    Constructing parse tree for ((a+b)*c)/d using data structures.

    • Use stack data structure to keep track of operators and operands.

    • Start with the innermost parentheses and work outwards.

    • Create a node for each operator and operand and link them together.

    • The root node will be the final result of the expression.

    • Example: ((a+b)*c)/d can be represented as / -> * -> + -> a, b, c, d.

  • Answered by AI
  • Q3. Given a function f that returns true or false based on whether the input string satisfies some hidden criterion C, write a function that verifies that all sub strings satisfy C
  • Q4. You hand over 'n' identical linked lists to n salespersons. After the day's work, these salesperson return the lists. Merge these lists such that all insertions, deletions, updates are taken care of, so th...
  • Ans. 

    Merge 'n' identical linked lists from 'n' salespersons to handle insertions, deletions, and updates.

    • Iterate through each linked list and merge them into a single linked list

    • Handle insertions, deletions, and updates by traversing the merged list and making necessary changes

    • Repeat the process for the next day by resetting the merged list

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: It was an online test. The company who hosted the test messed up with the interface, and a lot of people had trouble with a coding question that could not be solved because of the faulty interface. There was no retest.
The shortlisting was done after studying compile attempts, time devoted to various sections and other performance measures.

Round: Technical Interview
Experience: Told about myself, my interests, my internship projects and my work so far.
A few coding questions were asked too.
In the end, they asked if i have any questions.
Tips: Interviewers are friendly. Be calm, give your best.

General Tips: Start preparing early.
Develop priorities both sector wise and company wise.
Take sufficient water and food with you. Interviews can start at 4 am on the first day!
Have enough copies of resume and transcripts with you.
If you have been shortlisted for many companies, it is preferable to have a portfolio manager who manages your phone during the day and enables you to focus on the interviews.
College Name: IIT KANPUR

Skills evaluated in this interview

Get interview-ready with Top Microsoft Corporation Interview Questions

Interview Preparation Tips

General Tips: Before going for the interviews, take a sheet of paper and write an error free code, with extremely well named variables and optimized runtime each on Matrices, Linked List and Binary Tree. This will ensure that you have confidence and don't feel rusty while writing the code. Check your code twice to make it error free before showing the interviewer.
Skill Tips: geeksforgeeks is the most valuable site. The questions are generally taken from there. Careercup.com has the most common questions asked by Microsoft. Try to even brush up on OS concepts. Some interviewers ask that too. Practice all questions on linked list. This is generally the first interview question.
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: Don't ignore aptitude because it is really important. Never give up on any question in interview. Tell your interviewer anything you know about the question even if it is too simple to tell. Be confident.
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: 0. The most important thing. Know your level. Improve yourself by practicing more and be well aware of how smart you are. Wishful thinking can only get you so far.1. Writing fluent and optimized code is an art. I was lucky because I have been coding for a long time. If your coding skills aren't great, practice! I answered one crucial question completely wrong and still got through because of this skill.2. If you know an answer to a question, do not answer it immediately. Try to derive that answer from scratch and understand it before you go about blurting out the answer out of excitement. Let it look like a challenge.3. Learn External Sorting and Kadane's algorithm.4. Learn some basic OS facts like details about a program stack and what not.Make a CV right now! Compress it to one page. No one cares about your extra-curricular activities as much as you do. Include relevant details. Selection Procedure Preparation
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: As I got PPO from the company it was little better-luck for me as I escaped from On-Campus Competition.But yeah for getting intern and then PPO it was well challenging. But you can enjoy in parallel with little continuous hard work and smart preparation/work-out. Better find what will be asked in interview then learn accordingly concepts instead running behind CGPA(its enough 8- 8.5). You might get disappointed some time just try to catch plus from it and move forward. I have seen cases a student got rejected in one company placed in better one. You never know where is your destination. Better fix multiple than one.Now the pattern for Aptitude is changing. You will be given 60-90 min. and you have to code solutions for problems. Many of our batch-mates were not used to it. I was also rejected in more than 2 companies just because of not having good efficiency in handing online test. Be ready well before for such cases. Follow code-chef etc. Your preference for preparation should be DSA>OS>DBMS
Skill Tips: For Data-Structure and Algorithms preparation I followed NPTEL lectures and Corman. Whatever concept you learn from these try to implement using C/C++ or any language you like. It improved my coding as I started writing more Structured/Modular code which makes you more impressive in interviews. For more problems refer Careercup.com and GeekforGeeks.org. It was really luck for me during both intern and PPI interview I was asked questions from these websites. As these are favorites for all interviewers. Its better to write code first on paper than on compiler it reduces bugs/errors like NULL-pointer error. Aptitude C/C++ follow any good book and go through once. For C refer Dennis Ritchie. For DBMS/OS follow ppts or their standard textbooks. Try to learn as many concept as possible. Don't depend on your prof did he teach or not.
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: The interviews take up almost your complete day. Each round lasts for 45 min .The level of difficulty keeps increasing with each round. It is a bit exhausting and by the time you get to final round but trust me guys it's worth it.
Skill Tips: For Microsoft your code should be perfect and written in perfect programming style
College Name: NIT SURATHKAL
Contribute & help others!
anonymous
You can choose to be anonymous

Microsoft Corporation Interview FAQs

How many rounds are there in Microsoft Corporation Software Developer interview?
Microsoft Corporation interview process usually has 2-3 rounds. The most common rounds in the Microsoft Corporation interview process are Coding Test, Technical and One-on-one Round.
How to prepare for Microsoft Corporation Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Microsoft Corporation. The most common topics and skills that interviewers at Microsoft Corporation expect are AWS, Cloud, Compliance, Computer science and Infrastructure.
What are the top questions asked in Microsoft Corporation Software Developer interview?

Some of the top questions asked at the Microsoft Corporation Software Developer interview -

  1. You are given infinite sequence of continuos natural numbers-1,2,3,4,5,6.........read more
  2. Which of the following numbers cannot be represented accurately in > binary? > ...read more
  3. You have 3 baskets- one containing apples, one oranges and the last containing ...read more
How long is the Microsoft Corporation Software Developer interview process?

The duration of Microsoft Corporation Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.

Recently Viewed

INTERVIEWS

RDC Concrete (India)

No Interviews

INTERVIEWS

Sagar Cements

No Interviews

INTERVIEWS

RDC Concrete (India)

No Interviews

INTERVIEWS

UltraTech Cement

No Interviews

INTERVIEWS

Micron Technology

No Interviews

INTERVIEWS

HCLTech

No Interviews

INTERVIEWS

UltraTech Cement

No Interviews

INTERVIEWS

OneBanc Technologies

No Interviews

INTERVIEWS

CIE Automotive

No Interviews

Tell us how to improve this page.

Microsoft Corporation Software Developer Interview Process

based on 29 interviews

4 Interview rounds

  • Coding Test Round - 1
  • Coding Test Round - 2
  • One-on-one Round
  • HR Round
View more
Microsoft Corporation Software Developer Salary
based on 698 salaries
₹12 L/yr - ₹50.6 L/yr
254% more than the average Software Developer Salary in India
View more details

Microsoft Corporation Software Developer Reviews and Ratings

based on 78 reviews

4.4/5

Rating in categories

4.3

Skill development

4.5

Work-life balance

4.2

Salary

4.3

Job security

4.4

Company culture

4.0

Promotions

4.1

Work satisfaction

Explore 78 Reviews and Ratings
Software Engineer
2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
698 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Consultant
602 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Microsoft Corporation with

Google

4.4
Compare

Amazon

4.1
Compare

Deloitte

3.8
Compare

TCS

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent