Microsoft Interview experience | Set 95 (On-Campus for IDC)

• Difficulty Level : Medium
• Last Updated : 10 Jan, 2019

Microsoft came for Full Time IDC recruitment in our campus.

Round 1

Online test on CoCubes contains 3 Coding Questions (Only Function to complete)

1. Find the nth number that contains the digit k or is divisible by k. (2 <= k <= 9)
Example –
if n = 15 & k = 3
(3, 6, 9, 12, 13, 15, 18, 21, 23, 24, 27, 30, 31, 32, 33)
2. Add two binary number represented as strings.
```Example -
num1 = 101101 & num2 = 1011
3. Find the sum of all nodes that have no child at minimum level. Return -1 if root is NULL
Example –

```         5
/ \
2   6
/\   /\
7  3 9  4
/ \
8   3```

4. After this round 11 are shortlisted for direct interview. I was one of them.
Many are selected form Group Fly round where they were asked to do paper coding.
After Group Fly 14 more are selected for interviews.

Round 2

Face to Face Technical Interview Round (35 minutes)

1. Discussion on Project?
2. Difference between Process & Thread?
3. How web browsers use process & Threads, which is faster firefox or chrome and how?
4. How a Quad Core processor works?
5. What is tail command?
6. Given a very large file of unknown size, how will you print the last n lines (Number of lines not known)?
7. Write a program to connect next left node in a binary tree. Also first node of each level should be pointing to last node of next level? (Without using Queue)
8. Write a program to reverse a linked list in group of given size?

Some Questions asked to my Friends –

1. Write a program for LRU Scheduling Implementation?
2. How a task manager works in Windows?

Out of 25 only 2 are selected by Microsoft IDC. I was not one of them. Most of us are eliminated after First Technical Interview.

In coding round the selection is based on time taken to make the code (Since codes are easy). Mine were not efficient. So try to complete as early as possible.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up