Microsoft Interview | Set 19
I recently got interviewed for a position in Microsoft, following is my interview experience.
Round 1 (Telephonic):
Started with my introduction followed by my work in existing company.
- Given a circular doubly linked list, delete a given element. He was looking for all the corner cases
GeeksforGeeks Link
Round 2
- Given an integer array find largest sum of elements which is continuous (kadane algorithm), Later asked to make code changes to find the array also. Also asked to give test cases for the same.
GeeksforGeeks Link
- Given a design of an application, comment/recommend the changes to be done
Round 3:
- Given two linked lists check if they intersect??
GeeksforGeeks Link
- Test cases to test an ATM
Round 4:
- Find least common ancestors of a binary tree ( I said I know this, he moved to next question)
GeeksforGeeks Link
- Check if one array is subset of other ( discussed different methods like hashing, sorting ), asked to write a sorting function also
GeeksforGeeks Link
- Design questions related to the team they were interviewing for.
Finally I got an offer from Microsoft, they are very pleased with my performance. All the interviewers are very friendly. Thanks a lot geeksforgeeks, with out your help this would not have been possible.
This article is compiled by Chandrakanth. Many Many congratulations to Chandrakanth for his selection.
Last Updated :
10 Jan, 2019
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...