SWE Intern
Microsoft
3 rounds | 5 Coding problems
72 views
Interview preparation journey
Preparation
Duration: 9 months
Topics: Data Structures, Algorithms, OOPs, Graphs, Trees
Tip

Tip 1 : Participate in contest it would improve your examination temperament.
Tip 2 : Prepare OOPs, Networking, OS and System design along with DSA
Tip 3 : Make good projects (at least 2).

Application process
Where: Campus
Eligibility: above 7 CGPA
Resume tip

Tip 1 : Don't bluff in resume.
Tip 2 : Add coding profiles as it shows you have explored and shown interest in coding.

Interview rounds
01
Round
Easy
Video Call
Duration50 minutes
Interview date13 Aug 2021
Problems2
Overlapping Intervals

#### You have been given the start and end times of 'N' intervals. Write a function to check if any two intervals overlap with each other.

##### Note :
view more
Generate Parentheses

#### Given N pairs of parentheses, write a function to generate and print all combinations of well-formed parentheses. That is, you need to generate all possible valid ...

view more
02
Round
Medium
Video Call
Duration50 minutes
Interview date13 Aug 2021
Problems2
Puzzle Question

a. Given an big queue of below struct:
struct Log {
string machineName; //M1, M2…
string errorCode; //E1, E2…
int level; //0-error, 1-warning, 2-info
};
Write a program which can read the queue and generate the below information when the total number of logs with level 0 and 1 reach more than a threshold.
M1 E1 count
M1 E2 count
...

view more
Problem approach

I used unordered map of unordered map which keeps track of count for machine code and error code as [machine code][error code] = count and the question can be easily solved afterwards.

Interviewer told me to do this in more systematic manner I used OOPs concepts and he was happy with that

Number of Islands

#### You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.

view more
Problem approach

I straight away applied depth first search on this problem and maintained a count of water bodies in the answer variable. This was the most optimal solution, so he twisted this question and asked another one.

03
Round
Medium
Video Call
Duration60 minutes
Interview date13 Aug 2021
Problems1
Maximum Subarray Sum

#### You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.

view more
Problem approach

I first explained O(n^2) approach to the interviewer and he asked me to optimise. I then used kadane's algorithm and he asked me to code it. I coded and he asked me to find the print the subarray also. I added two if else statements in loop as follows:

for(i=0; i prev_max){
end = i;
start_o = start;
prev_max = curr_max;
}

}

Start a Discussion
Similar interview experiences
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
2813 views
SDE - 1
4 rounds | 6 problems
Interviewed by Microsoft
1730 views
SDE - Intern
3 rounds | 6 problems
Interviewed by Microsoft
31 views
SDE - 1
3 rounds | 5 problems
Interviewed by Microsoft
45 views
Companies with similar interview experiencs
SWE Intern
2 rounds | 5 problems
417 views