Skip to content
Related Articles

Related Articles

Microsoft MSIT Interview Experience | Set 85 (On-Campus)

View Discussion
Improve Article
Save Article
  • Difficulty Level : Hard
  • Last Updated : 09 Dec, 2015

Coding Round :

  1. Binary tree was given. Return a tree such that each internal node stores sum of all its child nodes. Each leaf node stores zero.

  1. One DP question :


GD Round for MSIDC :

  1. Reversal of Linked List in groups of K.

  1. Peripheral Traversal of Binary tree.


GD Round for MS-IT :

  1. Given numbers from 1 to 1000. Given a specific number, make guesses to reach to that specific number. In each guess, person will tell you specific number is less or more with the guess made. Find the minimum number of guesses.

  2. Each day, Microsoft search engine bing posts some informative image. How will you ensure each day image is different from the beginning of posting? ( Note the word – informative). —–> Do not distinguish on basis of color, texture, background etc. Think in terms of text. Even if orientation is different but text is same then image is same. Don’t think for RGB value either.


F2F Interview :

  1. How will you implement linked list with 1 million nodes? How will you access 999999 th node? Give some optimal design strategy and implementation.

  2. A graph with 1 million nodes. How to handle?

  1. Design the technology architecture for bookmyshow application.

  2. Explain your MTP Project.

  3. Asked CSP projects. Thread Library, DOTA Game and Chord implementation.

  4. Round Robin Scheduler Working.


This article is contributed by Surbhi Jain. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.


My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!