Open In App
Related Articles

Microsoft Interview Experience (On Campus for 2020 Summer Internship)

Like Article
Save Article
Report issue

Online Round: 

This round was held in There were three questions in a set and different sets for each students.

  1. Given coefficient of a quadratic equation find root of quadratic equation and return value with at most three precision. Like if answer is 3.0 then return 3.0 itself but if answer is 3.1249 theen return 3.125. Easy question, find discriminant and apply formula.
  2. Given two list of 1’s and 0’s. If first element of both list is same than remove it from both list. If Different than in first list pop first element and append it at last. How many numbers will left in list ? This question can be done using stack and queue.
  3. This question is based on sorting two arrays simultaneously.

They shortlisted 27 students for a Group Fly Round. 

Round 1 (Group Fly): 

There were two questions and we were told to write complete code on paper. 

  1. Find whether the number is lucky or not.  I gave iterative approach.
  2. Find tree is binary or not.

Round 2 (Technical Round – 1): 

First of all, interviewer asked me about my projects related questions for about 10 minutes. 

  1. Given a string find whether it is valid parentheses. First I gave approach using stack then interviewer asked me to optimize space complexity.
  2. I was given two linked list and multiply them and store it in third linked list. You can only use new space for third list and O(1) extra.

I was asked to write complete code for both questions in paper (C or Cpp). 

Round 3 (Technical Round – 2): 

  1. First question was connect node at same lavel.
  2. Given linked list and and integer m. I need to rotate each m nodes of link list. For example if my linked list is 1–>2–>3–>4–>5–>6–>7–>8–>9–>10–>11–>12–>13–>14 and m is 4 then return 4–>3–>2–>1–>8–>7–>6–>5–>12–>11–>10–>9–>14–>13. Constraints: Time Complexity O(n). Space Complexity O(1). Node value can not be changed.

In this round I was also asked two write complete code. 

Round 4 (Technical Round – 3): 

  1. There is single core CPU and this code is running “int main(){while(1);return 0;}” (infinite loop) and if we try to open notepad will it open ? Give reasons. I explaind Round Robin scheduling.
  2. Given a maze, define appropriate data structure to store it. Solve the maze and print the path. I was told to make some assumptions if needed. I assumed square maze and stored it using two maps. For solving I gave backtracking approach. Then he asked me to write pseudo code.

Thanks to GeeksforGeeks as you can find most of the questions on this platform.

Last Updated : 01 Jul, 2021
Like Article
Save Article
Share your thoughts in the comments
Similar Reads