Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Microsoft interview experience 2018

  • Difficulty Level : Basic
  • Last Updated : 14 Dec, 2018

Round 1:online test

There were 3 questions :OT

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

  1. Delete m nodes after n nodes in a linkedlist
  2. Find day of a date if 1 jan 1990 was monday
  3. Write a program in which if it is 75 make it 80 and if it is 74 make it 70

Round 2:Group fly



there were 2  questions :

  1. Infix to postfix
  2. connect nodes at same level in a binary tree

Interview Rounds:

Round 3:

  1. coin change (Denomination  problem of dp)

     

  2. Reverse k nodes in a linkedlist
    Input : list = 1 2 3 4 5 6 7 8 ,k = 3
     output = 3 2 1 6 5 4 8 7

Round 4:

  1. You are given a sorted array in which all elements are occurring twice except one element find that element in logn complexity
  2. You are given a array suppose 1 2 4 6 Now output should be 48 24 12 8
    This you have to do without using division operation

Round 5:

In this round  a simple problem was given suppose   you are given some files which may be dependent on each other so you have to tell all possible routes and also tell you which processes can run concurrently.He was asking me what you will do and how you will make its prgm.

 

 

My Personal Notes arrow_drop_up
Recommended Articles
Page :