AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Microsoft Corporation Software Developer Interview Questions and Answers for Freshers
69 Interview questions
Count the number of times a substring appears in a string.
Use a loop to iterate through the string and check for the substring at each index.
Use the count() method to count the number of occurrences of the substring.
Consider using regular expressions to find all occurrences of the substring.
Handle edge cases such as empty strings or substrings.
Use exponentiation by squaring algorithm to find nth power of a number in shortest computational time.
Use recursion to divide the power by 2 and multiply the base accordingly
If power is odd, multiply the base with the result of recursive call
If power is negative, take reciprocal of base and make power positive
Handle edge cases like power=0 and base=0 or 1
Time complexity is O(log n)
Find the nth largest number in a binary tree
Traverse the tree in-order and store the values in an array
Return the (n-1)th index of the sorted array in descending order
Use a max heap to keep track of the largest n elements
Compress a string by replacing consecutive characters with their count.
Iterate through the string and count consecutive characters.
Append the character and its count to a new string.
Handle edge cases like single characters.
What people are saying about Microsoft Corporation
Add two numbers stored in linked lists and return the sum in a linked list.
Traverse both linked lists and add the digits at each node while keeping track of carry.
Create a new linked list to store the sum digits.
Handle cases where one linked list is longer than the other.
Handle cases where the sum of the last digits results in a carry.
Return the new linked list with the sum digits.
Find the leftmost node in the same level as a given node in a binary tree.
Traverse the tree level by level using BFS
For each level, keep track of the leftmost node encountered
Return the leftmost node at the same level as the given node
Determine if connections between points in groups are planar or non-planar without overlaps.
Planar graphs can be drawn on a plane without edges crossing.
Non-planar graphs require edges to cross when drawn on a plane.
Example of a planar graph: A triangle connecting three points.
Example of a non-planar graph: K5 (complete graph with 5 vertices) cannot be drawn without crossings.
Use Kuratowski's theorem to check for ...
Insert an element into a sorted circular linked list.
Find the correct position to insert the element based on its value
Update the pointers of the previous and next nodes to include the new node
Handle special cases such as inserting at the beginning or end of the list
Example: Inserting 5 into a list with values 1, 3, 4, 6, 7 would result in 1, 3, 4, 5, 6, 7
Use exponentiation by squaring algorithm to find nth power of a number in shortest computational time.
Use recursion to divide the power by 2 and multiply the base accordingly
If power is odd, multiply the base with the result of recursive call
If power is negative, take reciprocal of base and make power positive
Handle edge cases like power=0 and base=0 or 1
Time complexity is O(log n)
Find the nth largest number in a binary tree
Traverse the tree in-order and store the values in an array
Return the (n-1)th index of the sorted array in descending order
Use a max heap to keep track of the largest n elements
Microsoft Corporation Software Developer Interview Experiences for Freshers
20 interviews found
Tarun Jaiswal
DSA, Graph, DP, Arrays
Anonymous
3 codes of medium difficulty
(2 Questions)
- Q1. Sorting question
- Q2. Statement based question
I applied via Referral and was interviewed in Apr 2023. There were 3 interview rounds.
2 Medium leetcode problems
(1 Question)
- Q1. 2 Leetcode Medium Questions
Interview Preparation Tips
2 simple coding questions on online platform
(2 Questions)
- Q1. 2 questions were offered and had to choose any one to answer. One was finding how many swaps till the array is sorted. This was using graphs.
- Q2. Other was arranging red and blue marbles together. DP problem
Interview Preparation Tips
No basic questions were asked.
Interviewer was really good.
I applied via Campus Placement and was interviewed in Mar 2022. There were 2 interview rounds.
(4 Questions)
- Q1. B .com students software eligible yes or no
- Q2. Iam intereste software
- Q3. Business development
- Q4. What type of program
- Ans.
I'm sorry, could you please clarify what type of program you are referring to?
Ask for more information about the program in question
Provide examples of different types of programs
Clarify the context of the question
Interview Preparation Tips
I appeared for an interview in Apr 2021.
(1 Question)
Round duration - 90 minutes
Round difficulty - Hard
- Q1.
Stock Buying and Selling Problem Statement
Given an array of stock prices where each element represents the stock price for a given day, determine the maximum profit you can achieve from buying and sellin...
- Ans.
Determine maximum profit from buying and selling stocks on different days.
Iterate through the array of stock prices and calculate the profit for each pair of days.
Keep track of the maximum profit obtained by selling and buying stocks on different days.
Return the maximum profit achieved.
(1 Question)
Round duration - 40 Minutes
Round difficulty - Medium
- Q1.
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
- Ans.
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken for each node to catch fire and burn the tree accordingly.
Consider the adjacency of nodes to determine the spread of fire.
Handle cases where the start node is at different levels in the tree.
Optimize the solution to...
(1 Question)
Round duration - 40 minutes
Round difficulty - Easy
- Q1.
Flatten Binary Tree Problem Statement
Given a binary tree consisting of integer values, your task is to convert the binary tree into a linked list where the nodes of the linked list follow the same order ...
- Ans.
Convert a binary tree into a linked list following pre-order traversal order.
Perform pre-order traversal of the binary tree and convert it into a linked list.
Use the right pointer of the binary tree as the 'next' pointer for the linked list.
Set the left pointer to NULL for each node in the linked list.
Example: Input - 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, Output - 1 2 4 7 3 5 6
(2 Questions)
Round duration - 25 Minutes
Round difficulty - Hard
- Q1. Can you provide a code example that demonstrates communication between two processes?
- Ans.
Demonstrate communication between two processes using inter-process communication (IPC) methods.
Use sockets for communication between two processes running on the same or different machines.
Implement message passing using shared memory or message queues.
Utilize pipes for communication between parent and child processes.
- Q2.
Gray Code Problem Statement
You are given a number
grayNumber. Your task is to find and return the Gray code sequence.Explanation
The Gray code sequence should satisfy the following conditions:
1. Inc... - Ans.
Find and return the Gray code sequence for a given number.
Generate Gray code sequence by following the conditions provided in the problem statement.
Ensure that consecutive numbers in the sequence differ by exactly 1 bit.
Start the sequence with 0 and include numbers up to 2^grayNumber - 1.
Return the sequence in decimal form as a list/vector.
If multiple valid sequences exist, return any of them.
Interview Preparation Tips
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Skills evaluated in this interview
I appeared for an interview in Jan 2021.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
it was around 9 :30 am interviewer was friendly
- Q1.
Find All Triplets with Zero Sum
Given an array
Arrconsisting ofNintegers, find all distinct triplets in the array that sum up to zero.Explanation:
An array is said to have a triplet {Arr[i], Arr[j],...
- Ans.
Find all distinct triplets in an array that sum up to zero.
Use a nested loop to iterate through all possible combinations of triplets.
Sort the array to easily identify duplicates and skip unnecessary calculations.
Use two-pointer technique to find the remaining element for each pair of elements.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
morning 11 am
interviewer was friendly
- Q1.
Generate Binary Strings from Pattern
Given a string
STRcontaining '0', '1', and '?' special characters, generate all possible strings by replacing each '?' with either '0' or '1'.Input:
The first line... - Ans.
Generate all possible binary strings by replacing '?' with '0' or '1'.
Iterate through the input string and replace '?' with '0' and '1' recursively to generate all possible strings.
Use backtracking to explore all possible combinations.
Sort the generated strings lexicographically before returning the final result.
- Q2.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Calculate the total sum of all root to leaf paths in an arbitrary binary tree.
Traverse the tree in a depth-first manner to calculate the sum of each root to leaf path.
Keep track of the current path sum and update it as you traverse the tree.
Return the total sum modulo (10^9 + 7) as the final result.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Hard
it was around 3
good recieving of interviewer
- Q1.
The Celebrity Problem
Imagine there are 'N' people at a party, each assigned a unique ID from 0 to N-1. A celebrity at the party is a person who is known by everyone but knows no one else.
Problem Statem...
- Ans.
Identify the celebrity at a party where one person knows everyone but is not known by anyone.
Use a two-pointer approach to eliminate non-celebrity candidates.
Start with two pointers at the beginning and end of the party.
If A knows B, A cannot be the celebrity; move A to the right.
If A does not know B, B cannot be the celebrity; move B to the left.
Repeat until only one person remains, check if this person is known by ev...
Round duration - 50 Minutes
Round difficulty - Easy
it was arround 2 afternoon
Interview Preparation Tips
Tip 1 : Prepare for common interview questions
Tip 2 : Practice, practice, practice.
It's one thing to come prepared with a mental answer to a question like, "Why should we hire you?" It's another challenge entirely to say it out loud in a confident and convincing way. The first time you try it, you'll sound garbled and confused, no matter how clear your thoughts are in your own mind! Do it another 10 times, and you'll sound a lot smoother and more articulate.
But you shouldn't do your practicing when you're "on stage" with a recruiter; rehearse before you go to the interview. The best way to rehearse? Get two friends and practice interviewing each other in a "round robin": one person acts as the observer and the "interviewee" gets feedback from both the observer and the "interviewer." Go for four or five rounds, switching roles as you go. Another idea (but definitely second-best) is to tape record your answer and then play it back to see where you need to improve. Whatever you do, make sure your practice consists of speaking aloud. Rehearsing your answer in your mind won't cut it.
Tip 1 : Should have different projects
Tip 2 : Internships in good companies
Skills evaluated in this interview
I appeared for an interview in May 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
2 coding questions were asked
- Q1.
Count Squares in a Matrix
Given a matrix of size N * M, your task is to count the number of squares present within it.
Since the count can be extremely large, the result should be computed modulo 109 + 7...
- Ans.
Count the number of squares in a given matrix modulo 10^9 + 7.
Iterate through all possible square sizes from 1 to min(N, M)
For each square size, count the number of squares that can fit in the matrix
Return the total count modulo 10^9 + 7
- Q2.
First Missing Positive Problem Statement
You are provided with an integer array
ARRof length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T... - Ans.
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited by changing the sign of the corresponding index.
After marking all positive integers, iterate again to find the first positive integer with a positive value.
Return the index of the first positive integer found plus one as the answer.
(1 Question)
Round duration - 100 Minutes
Round difficulty - Medium
There was 1 coding question, and questions on CN, DBMS, OS and system design and also my resume.
- Q1.
Remove K Digits Problem Statement
You are given a non-negative integer represented as a string
numand an integerk. Your task is to determine the smallest possible integer by removing exactlykdigits fr... - Ans.
Given a non-negative integer as a string and an integer k, find the smallest possible integer after removing k digits.
Use a stack to keep track of the digits in non-decreasing order from left to right.
Pop elements from the stack if the current digit is smaller than the top of the stack and k is greater than 0.
Handle edge cases like leading zeros and ensuring the final result is not an empty string.
Example: For num = "1...
(1 Question)
Round duration - 40 Minutes
Round difficulty - Medium
Interviewer was quite experienced he asked me 1 coding question and asked questions about college and resume
- Q1.
Longest Duplicate Substring Problem Statement
You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings ...
- Ans.
Find the length of the longest duplicate substring in a given string.
Use binary search to find the length of the longest duplicate substring.
Implement Rabin-Karp algorithm for efficient substring search.
Consider using a rolling hash function for substring comparisons.
Interview Preparation Tips
Tip 1 : Try to cover all most common questions of all topics(atleast 300+ questions)
Tip 2 : Try to see as many interview experience as possible of the company you are applying.
Tip 3 : Try to give atleast 2-3 mock interview before main interview
Tip 1 : Try to put competitive programming ranks if possible or Coding Ninjas Certificate, or any proof that you do programming regularly.
Tip 2 : Try to add atleast 2 projects, and study about those projects well.
Skills evaluated in this interview
I appeared for an interview in Nov 2020.
(2 Questions)
Round duration - 100 minutes
Round difficulty - Easy
3 coding Questions:
1st : Easy question based on simple loop iteration
2nd : Medium level Data structure question
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole best from
scratch)
It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there) having camera on.
- Q1.
Ninja and the Storyteller Problem
Ninja is eager to listen to stories from the renowned Storyteller of Ninjaland. The storyteller charges 'Y' coins per story. However, for every set of 'X' stories told, N...
- Ans.
Calculate the total number of stories a ninja can hear from a storyteller based on given conditions and constraints.
Calculate the number of stories Ninja can buy with available coins and without free stories.
Calculate the number of free stories Ninja can get based on the number of stories bought.
Add the total number of bought and free stories to get the final result.
- Q2.
Buy and Sell Stock Problem Statement
You are tasked to help a friend with stock trading for the next 'N' days. He can either buy or sell a stock, with the condition that he can complete at most 2 transact...
- Ans.
Determine maximum profit from at most 2 stock transactions over 'N' days.
Iterate through the prices array to find the maximum profit from 2 transactions.
Keep track of the maximum profit by buying and selling stocks at the right times.
Consider edge cases like when there are no profitable transactions.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
This was a completely technical coding round where I was asked to solve the problems of data structures.
- Q1.
Minimum Cost Path Problem Statement
Given an integer matrix with dimensions
m x n, determine the minimum cost required to reach from the cell (0, 0) to the cell (m-1, n-1).You are allowed to move from a...
- Ans.
The problem involves finding the minimum cost path in a matrix by moving right, down, or diagonally down-right.
Use dynamic programming to keep track of the minimum cost at each cell
Consider the three possible directions for movement and calculate the cost accordingly
Start from the top-left cell and iterate through the matrix to find the minimum cost path
- Q2.
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
- Ans.
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Traverse the tree to find the start node and calculate the time for fire to spread to all nodes
Use a queue to keep track of nodes to be burned next
Increment time for each level of nodes burned until the entire tree is burnt
Round duration - 20 minutes
Round difficulty - Easy
It was held on Google meet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence
the interviewer mostly asked me questions about my interests in technical field and the project that I have done
Interview Preparation Tips
Tip 1 : Practice atleast(easy and medium questions from leetcode under(Top Interview Questions)) and all the questions from Gfg under(must to do coding questions for interviews))
Tip 2 : Don't learn each and every question you solved but try to solve question in a way that you can solve its variation during interviews
Tip 3 : Do one project(one is enough) which you can explain with full technical details (why you used this technology, and all logics you applied in implementation)
Tip 1 : Have at least one project which you have made yourself and you should know all the technical questions related to that project (I feel project domain hardly matters like web development or android or ML/AI)
Tip 2 : You should Put only those skills in resume :
1. Which the company requires (eg if you know company doesn't require Networking domain knowledge so
don't include it unnecessary if you are not much confident in it)
2. For on campus internships resume shortlisting is very easy so don't add anything unnecessary which might cause you pain during interview.
Skills evaluated in this interview
I appeared for an interview in Sep 2020.
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Easy
Had some small chit-chat regarding how Work from Home is going on for him and me. Later he introduced himself and asked the same.
Coming to technical questions, he asked me the algorithm and also asked me to code the questions mentioned below. Discussed the time complexities and edge cases.
- Q1.
Spiral Matrix Problem Statement
You are given a
N x Mmatrix of integers. Your task is to return the spiral path of the matrix elements.Input
The first line contains an integer 'T' which denotes the nu... - Ans.
The task is to return the spiral path of elements in a given matrix.
Iterate over the matrix in a spiral path by keeping track of the boundaries.
Print the elements in the spiral path as you traverse the matrix.
Handle cases where the matrix is not a square matrix separately.
- Q2.
Group Anagrams Problem Statement
Given an array or list of strings called
inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth... - Ans.
Group anagrams in an array of strings based on character frequency.
Create a hashmap to store sorted strings as keys and corresponding anagrams as values.
Iterate through the input strings, sort each string, and add it to the hashmap.
Return the values of the hashmap as grouped anagrams.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round started without any introduction, and he directly jumped into the question. Asked me about the algorithm, and later coded it and ran it. And then he asked me to optimize it. Finally, he asked me if I had any questions.
- Q1.
Tic-Tac-Toe Design Problem
Design a 2-player Tic-Tac-Toe game played on an
N*Ngrid where Player 1 uses ‘X’ and Player 2 uses ‘O’. A move is always valid and occupies an empty spot.If a player places
... - Ans.
Design a 2-player Tic-Tac-Toe game on an N x N grid where players take turns placing their marks, and the first player to get N marks in a row wins.
Implement a function move(row, col, player) to handle each player's move and check for a win condition.
Keep track of the board state and update it after each move.
Check for winning conditions horizontally, vertically, and diagonally after each move.
Return the result (0 for ...
Interview Preparation Tips
Tip 1 : Solve as many questions as you can
Tip 2 : Practice Quantitate aptitude.
Tip 3 : Don't lie on your resume.
Tip 1 : Have some good projects.
Tip 2 : Don't lie on your resume.
Skills evaluated in this interview
Microsoft Corporation Interview FAQs
Some of the top questions asked at the Microsoft Corporation Software Developer interview for freshers -
The duration of Microsoft Corporation Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Microsoft Corporation Interviews By Designations
- Microsoft Corporation Software Engineer Interview Questions
- Microsoft Corporation Software Developer Interview Questions
- Microsoft Corporation Senior Software Engineer Interview Questions
- Microsoft Corporation Software Developer Intern Interview Questions
- Microsoft Corporation Intern Interview Questions
- Microsoft Corporation Technical Support Engineer Interview Questions
- Microsoft Corporation Software Development Engineer Interview Questions
- Microsoft Corporation Data Scientist Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 3 interview experiences
Difficulty level
Duration
Top Skills for Microsoft Corporation Software Developer
Software Developer Interview Questions from Similar Companies
Microsoft Corporation Software Developer Reviews and Ratings
based on 92 reviews
Rating in categories
|
Software Engineer
2.5k
salaries
|  ₹24.9 L/yr - ₹44.3 L/yr |
|
Senior Software Engineer
1.4k
salaries
| ₹24.8 L/yr - ₹95 L/yr |
|
Software Engineer2
1.2k
salaries
| ₹33.1 L/yr - ₹60 L/yr |
|
Software Developer
1.1k
salaries
| ₹15 L/yr - ₹52.7 L/yr |
|
Support Engineer
615
salaries
| ₹9 L/yr - ₹32 L/yr |
Amazon
Deloitte
TCS
- Home >
- Interviews >
- Microsoft Corporation Interview Questions >
- Microsoft Corporation Interview Questions for Fresher
