Microsoft Corporation Interview Questions, Process, and Tips

2 coding test, 1 medium and i hard LC

Q1. DS Algo, add and diff of numbers represented as linked list
Add your answer

Q1. What is your experience with Program Management?
Add your answer

Q1. What type of relationship would you like to keep with your clients?
Add your answer
Q2. Tell me about your experience about managing multiple projects
Add your answer

1 hour, arrays and strings

Q1. Sorting, Sliding window
Add your answer

Ask medium level questions

Q1. Why do u want to join msft
Add your answer
Q2. What is your long term goal
Add your answer

Basic aptitude and technical questions

Q1. Projects and basic inteoduction
Add your answer
Q2. Previous experience
Add your answer

60 mins coding test with 2 questions (leet code easy-medium)

Q1. BFS implementation on a tree
Ans. 
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
Answered by AI
Add your answer
Q2. Find the depth of the tree
Ans. 
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.
Answered by AI
Add your answer