I applied through other source. The process took 4 weeks. I interviewed at Microsoft in Apr 2022
Interview
The interview was scheduled after the completion of engage mentorship program which is organized every year in the month of march-April by Microsoft for 2nd year engineering students open for all the branches and for all colleges. My interview started 3 hours late because my interviewer has some work and in the end, they changed the interviewer. The interviewer was 50 aged person with 6 years of experience.
Interview questions [1]
Question 1
First Asked to give your intro briefly in 5 min.
Then he asked me about my experience in the one-month mentorship program, then he asked me to elaborately explain how I chose the topic and how I proceed and what technologies I used, and how I used them.
after 30 min discussion, he asked me if I have any questions for him.
The process had three rounds: an online assessment following resume shortlisting, and two interviews focused on Data Structures and Algorithms, testing both problem solving skills and coding efficiency. Also projects in resume were asked.
Interview questions [1]
Question 1
They asked me to solve a DSA problem on arrays, focusing on both the brute force and optimized approach, and explain the trade offs between time and space complexity
Online test with 2 LC Medium-Hard level.
1 Greedy + 1 Graph
Interview 2 LC Medium level.
1 Graph + 1 Tree
Finally, HR Round based on resume, primarily ask about projects and experienced technologies.
Interview questions [1]
Question 1
1 Greedy + 1 Graph in OT (120 min)
1 Graph (30 min)
1 Tree (30 min)
I applied through college or university. The process took 1 week. I interviewed at Microsoft (Nueva Delhi)
Interview
Online interview assessment with three hard level DSA questions, primarily based on resume achievements, including two data structure and algorithm problems focused on arrays and strings, plus achievement driven discussion
Interview questions [1]
Question 1
One of the DSA questions they asked was: Reverse a singly linked list without using extra space, and explain both iterative and recursive approaches with time and space complexities