# Microsoft Internship Interview Experience | On-Campus 2021

• Difficulty Level : Easy
• Last Updated : 07 Oct, 2021

Round 1: This was an online coding test held on the codility platform.

• One question was from string and one question was from greedy.

Round  2: 48 students were shortlisted for the face-to-face interviews. All the rounds were mostly DSA based. Question asked:

1. Divide the LinkedList into k segments and print the segments in reverse order. First I gave him the brute force approach and then he told me to optimize the space complexity of the code and finally code the solution. He also asked me to dry run on few test cases. eg:1-2-3-4 k=2 output:3-4-1-2 (https://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/)

Round 3: After 2 hours I was called for the next round. The interviewer gave me a problem:

1. There are n cities and there are roads between the pair of cities. Find if there is a path between the two given cities. This was a simple graph-based question I just needed to find if source and destination lie in the same component or not. He was satisfied with my solution and asked me to code out. Then he extended the problem and told me to find the path if it exists and asked to dry run for few test cases. (https://www.geeksforgeeks.org/find-if-there-is-a-path-between-two-vertices-in-an-undirected-graph/)

Round 4: After 3 hours I was called for the final round.

• The interview began with a brief discussion on my projects.
• Then he gave me a problem that there are two rectangles in the x-y plane with given dimension and coordinate of one vertex given you have to find the dimension of the overlapped rectangle if there is an overlap I had to explain all the conditions when there will be partial overlap, complete overlap, no overlap and finally code out the solution.