Microsoft Corporation
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Aug 2024. There were 2 interview rounds.
1 hour test contains 2 coding questions.
To delete a node from a singly or doubly linked list, update the pointers of the previous and next nodes.
For a singly linked list, update the next pointer of the previous node to skip the node to be deleted.
For a doubly linked list, update the next pointer of the previous node and the previous pointer of the next node to skip the node to be deleted.
Use regex pattern to validate an email address
Use regex pattern /^[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}$/
Ensure email has valid format with username, @ symbol, domain, and top-level domain
Test regex pattern against different email addresses for validation
I applied via Referral and was interviewed in Nov 2024. There were 2 interview rounds.
SIMPLE and easy which was mcqs based. easy
Two 2 leet code question based on array and strings
What people are saying about Microsoft Corporation
Dp and graph was the area of focus
Microsoft Corporation interview questions for designations
I applied via Campus Placement
Get interview-ready with Top Microsoft Corporation Interview Questions
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
There were two medium level leetcode questions.
There were two questions. one leetcode medium and one hard
I applied via Company Website and was interviewed before Jun 2023. There were 2 interview rounds.
60 mins coding test with 2 questions (leet code easy-medium)
BFS (Breadth First Search) is a traversal algorithm used to visit all nodes of a tree level by level.
Start by visiting the root node, then visit all its children before moving on to the next level
Use a queue data structure to keep track of nodes to visit next
Repeat the process until all nodes have been visited
The depth of a tree is the length of the longest path from the root node to a leaf node.
The depth of a tree can be calculated by traversing the tree and keeping track of the depth at each node.
The depth of a tree with only one node (the root) is 0.
For example, in a binary tree, the depth of the tree is the maximum depth of the left and right subtrees plus 1.
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
One medium leetcode question and design question
based on 18 interviews
2 Interview rounds
based on 21 reviews
Rating in categories
Software Engineer
1.9k
salaries
| ₹13 L/yr - ₹50 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹25 L/yr - ₹85 L/yr |
Software Engineer2
1k
salaries
| ₹20 L/yr - ₹72 L/yr |
Consultant
599
salaries
| ₹13 L/yr - ₹36.7 L/yr |
Support Engineer
578
salaries
| ₹7.7 L/yr - ₹30 L/yr |
Amazon
Deloitte
TCS