Microsoft Interview Experience | Set 136 (On Campus for Internship)
Last Updated :
18 Dec, 2018
First Round consisted of 3 easy coding problems to be solved on an online platform (CoCubes) . The problems were fairly easy and didn’t require much thought . Extra marks were given for optimized solutions requiring less memory and time . Problems were as follows –
- Given 2 numbers m and n , find if the sum m+n has the same number of digits as n . If true then print m+n otherwise print n.
- Given a binary string(a string consisting only of 0s and 1s) find the length of the longest contiguous occurrence of 1s.
- Third question was to find length of longest AP in given set of numbers.
From those who qualified the online coding round – 14 people were selected for direct interview and 10 people were selected for an additional fly round . From those 10 , around 3-4 were selected for interviews.
First Interview:
The interviewer asked me to give a short introduction about myself and then based on my disciplinary electives ,
- He asked me to design a simple Information Retrieval system. Given a file containing various phrases , he asked me to provide an outline for building a query system such that it autocompletes the query the user is typing . He didn’t ask for any code , just for a basic outline of the functions that would be used and the data structures I thought would be implemented while building such a system.
Second Interview:
Interviewer asked me two questions Algorithms – one was based on trees and DP and the other was a question on Depth First Search.
Third Interview:
Interviewer asked a simple problem
- Print all nodes at distance k from a given node
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...