Microsoft came to our campus in which around 170 people participated.
This was conducted on CoCubes.com where we had to solve 3 questions in 75 minutes. The questions were different for everyone. Questions for me were:
- We had been given a linked list and we had to segregate its even and odd position nodes in such a way that odd position nodes before even positioned nodes and even positioned nodes had to be appended after odd positioned nodes but in a reverse order. We were not allowed to use any extra space.
Ex – linked list: – 1 -> 2 -> 3 -> 4 -> 5 -> 6 Output: – 1 -> 3-> 5 -> 6 -> 4-> 2.
Out of that 72 people were selected for further rounds.
Further rounds were conducted in Microsoft Hyderabad office.
In this 2 questions were displayed which were common to everyone. There was a mentor assigned to 6 people with whom you can discuss the questions and ask doubts. (PS: Try to talk to them as much as possible. Tell them your solution before submitting. Tell them some good test cases which you could think of) .
Out of that 36 people were selected for further rounds.
Technical Interview Round 1:
I didn’t find the interviewer very helpful. He asked me some out of the blue questions too.
- Count the number of ones in the binary representation of a number.
I gave him the naive approach first. He asked me to reduce the time complexity. I told him we could use memoization. Again he said I want something in between (i.e. neither too much space complexity nor too much time complexity). Then after some unsuccessful attempts, he asked to use threads (weird, yeah!). Then he was not satisfied and asked to move on.
This was quite easy and I wrote the full code. However, he asked some test-case specific questions and I was not really able to answer them. Then we moved on.
Luckily I was selected for Round 2.
Technical Interview Round 2:
This time the interviewer
- 1.) Given two strings s1 and s2. Remove all instances of characters in s2 from s1 in place.
Ex: s1 = "hello world" : s2 = "eo" ; new s1 = "hll wrld"
I gave him two approaches.
a.) O(mn) where we use brute force.
b.) O(n) where we use a hash map to store character of s2
and traverse s1.
He also wanted something in between. After thinking for s
ome time I came up with a mlogn approach where you sort s2 and search for characters of s1 in s2.
was really helpful and sweet. He asked me a question:
He was really impressed and happy.
After this, I
was told that I got the internship! 😀 Geeksforgeeks was really helpful for me for preparing for my internship.
- Microsoft Interview Experience | Set 172 (Off-Campus for SDE 1)
- Microsoft Interview Experience | Set 59 (On-Campus)
- Microsoft Interview Experience | Set 71 (Off-Campus)
- Microsoft Interview Experience | Set 41 (On-Campus)
- Microsoft Interview experience | Set 98 (On Campus for IDC)
- Microsoft Interview experience | Set 122 (Off-Campus)
- Microsoft Interview Experience | Set 159 (On campus)
- Microsoft Interview experience | Set 113 (On-Campus)
- Microsoft Interview Experience | Set 175 (On-Campus)
- Microsoft Interview Experience | Set 87 (On-Campus)
- Microsoft Interview Experience | Set 76 (On-Campus)
- Microsoft Interview Experience | Set 40 (Off-Campus)
- Microsoft Interview experience | Set 125 (On-Campus for IDC)
- Microsoft interview experience | Set 180 (On-Campus)
- Microsoft Interview Experience | Set 176 (On-Campus)
- Microsoft Interview experience | Set 118 (On-Campus for IDC)
- Microsoft Interview Experience, FTE, (on-campus)
- Microsoft Interview experience | Set 102 (On Campus for IDC)
- Microsoft Interview experience | Set 101 (On Campus for IDC)
- Microsoft Interview Experience | Set 158 (On-Campus)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.