Microsoft Interview Experience | Pool-Campus

Interview was conducted in Bangalore for MS hyd  team. (Experienced, Pool Recruitment )
Round 1
  1. Explain about yourself
  2. Explain hash map in java
  3. Explain the working of different types of locking mechanism
  4. Explain the working of different kinds of locks in database
  5. Explain concurrent hash map in java
    1. Explain how locking is done in concurrent hashmap
  6. Explain the working of garbage collector in java
  7. Merge Sort https://www.geeksforgeeks.org/merge-sort/
    1. Variation of merge sort, there are two sorted arrays a and b. b contains some elements  and some free cells which is equal to length of a. Sort a and b without using extra space
  8. Lowest Common ancestor in a binary tree
  1. Search in a sorted and rotated array
Round 2
  1. Connect nodes at same level
  1. A general puzzle problem
Round 3
  1. Introduce yourself
  2. What happens when you type www.bing.com and hit enter
  3. Design a messaging app similar to WhatsApp
  4. What is the most difficult part in implementing a caching algorithm, why?
  5. Explain different types of caching
    1. Which is the best caching method
  6. Most challenging problem faced in your current company, how did you solve it
  7. Implement a hybrid dictionary
Round 4
Solve using parallel programming
  1. Implement garbage collector
  2. Implement grep for a file contains 10000 lines
    1. Variation :: Implement grep for 10000 files containing 10000 lines
  3. What is the difference between process and thread


Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.


Article Tags :
Practice Tags :


2


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.