Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
To find the max element in a heap, simply return the root element.
The max element in a heap is always the root element.
No need to traverse the entire heap, just return the root element.
Example: If the heap is [10, 8, 5, 4, 3, 2], the max element is 10.
I applied via Campus Placement and was interviewed in Jan 2024. There was 1 interview round.
3 coding questions, mostly focused on dp, graphs strings and arrays, it was medium to hard level
I applied via Company Website and was interviewed in Feb 2023. There were 4 interview rounds.
What people are saying about Microsoft Corporation
Microsoft Corporation interview questions for popular designations
I applied via Campus Placement
Coding related basic questions
AI-ML project involves using artificial intelligence and machine learning algorithms to analyze data and make predictions.
Collecting and cleaning data for training the AI model
Choosing the appropriate machine learning algorithm for the task
Evaluating the performance of the model using metrics like accuracy and precision
Implementing the model in a real-world application
Continuously improving the model through feedback a
Get interview-ready with Top Microsoft Corporation Interview Questions
I applied via Approached by Company and was interviewed before Apr 2023. There were 4 interview rounds.
You need to write code as algorithm for the given problem
You will need a end to end architecture and details , along with problem solving skillset
Experience, scope and challenges
Present a cloud solution based on MS Azure Stack
I applied via Campus Placement and was interviewed in Mar 2023. There were 3 interview rounds.
My name is mayur chavan and I am a designer
I applied via Referral and was interviewed in Nov 2023. There were 2 interview rounds.
Maths and logical reasoning
Very simple question of python
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
There was 2 ques in OA round. One question out which i solved by using dp here OA focus mainly over graph and dp
To find the minimum element in a stack in O(1) space, use an auxiliary stack to keep track of the minimum element at each step.
Create an auxiliary stack to store the minimum element at each step.
When pushing an element onto the main stack, compare it with the top element of the auxiliary stack and push the smaller one onto the auxiliary stack.
When popping an element from the main stack, also pop the top element from th...
A segmentation fault occurs when a program tries to access a memory location that it is not allowed to access.
Segmentation faults commonly occur due to accessing an uninitialized pointer or accessing an array out of bounds.
Here is an example code that causes a segmentation fault: int main() { int* ptr; *ptr = 10; return 0; }
Generate all permutations of balanced parentheses and store them in a vector.
Use backtracking to generate all possible combinations of parentheses
Check for balanced parentheses using a stack
Store each valid combination in a vector
Return the vector of permutations
Some of the top questions asked at the Microsoft Corporation interview -
The duration of Microsoft Corporation interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 375 interviews
Interview experience
based on 1.7k reviews
Rating in categories
Software Engineer
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
698
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
602
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Deloitte
TCS