Filter interviews by
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
The square root of a number N is a value that, when multiplied by itself, gives N.
The square root of 9 is 3, because 3 * 3 = 9
The square root of 16 is 4, because 4 * 4 = 16
The square root of 25 is 5, because 5 * 5 = 25
Check if there is a path in a binary tree to a given target
Start from the root node and traverse the tree using depth-first search (DFS)
Keep track of the current path sum and compare it with the target value
Return true if a path with the target sum is found, otherwise return false
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
What people are saying about Microsoft Corporation
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.
Remove duplicates in unsorted linked list
Create a hash table to keep track of visited nodes
Traverse the linked list and check if the node is already visited
If visited, remove the node from the linked list
Time complexity: O(n)
Example: 1 -> 2 -> 3 -> 2 -> 4 -> 1 -> null
Output: 1 -> 2 -> 3 -> 4 -> null
Find intersection point of two linked lists.
Traverse both lists and find their lengths
Move the head of the longer list by the difference in lengths
Traverse both lists in parallel until they meet at the intersection point
To reverse the order of words in a given sentence, we need to split the sentence into words and then reverse the order of the resulting array.
Split the sentence into words using a delimiter like space or comma
Reverse the resulting array of words
Join the reversed array of words using a delimiter to form the reversed sentence
Given N people on an M*M grid, find the point with the least total distance for all to meet.
Calculate the Manhattan distance for each point on the grid
Find the point with the minimum total distance
Use dynamic programming to optimize the solution
Consider edge cases such as when N=1 or M=1
The number of islands problem involves counting the number of connected islands in a grid.
An island is a group of connected 1s in a grid of 0s and 1s.
Use depth-first search or breadth-first search to traverse the grid and count the islands.
Keep track of visited cells to avoid counting the same island multiple times.
I applied via Campus Placement 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 appeared for an interview in Apr 2025, where I was asked the following questions.
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
Dp and graph was the area of focus
I applied via Campus Placement
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...
The duration of Microsoft Corporation Intern interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 19 interview experiences
Difficulty level
Duration
based on 22 reviews
Rating in categories
Software Engineer
2.5k
salaries
| ₹15 L/yr - ₹54 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹36.8 L/yr - ₹75.6 L/yr |
Software Engineer2
1.2k
salaries
| ₹22 L/yr - ₹72 L/yr |
Software Developer
1k
salaries
| ₹26.4 L/yr - ₹46 L/yr |
Support Engineer
615
salaries
| ₹9 L/yr - ₹32 L/yr |
Amazon
Deloitte
TCS