Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Microsoft Interview Experience | Set 71 (Off-Campus)

  • Difficulty Level : Medium
  • Last Updated : 27 Sep, 2015

Written test:
They conducted written test in HackerRank and an hour duration. They asked me to implement the functions for the following two problems.
1) Maximum product Sum of an Array.

2) Building bridges problem.

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!

Technical Interview 1:
He is very friendly and given hints to me while solving problems.
1) First he asked me about an overview of my current project then most challenging thing faced in the project. After my response, he asked me what you learnt from that challenging thing.

2) Given an array of integers of the size of n, it contains zeros in random positions, we need to move all zeros to end of the array in a single scan without extra space.

3) Merging point of two linked lists.

4) questions related to programming languages
    a) about inheritance
    b) about classes and interfaces
    c) abstract classes and virtual functions, …

5) He given a situation and asked me to design required classes and functions which are useful to program that situation.

6) The last question is given a number we need to find the next nearest number in 2^n.
input: 127 output: 128
input: 129 output: 256

Technical Interview 2:

He asked me very simple questions, but he wants to cover each and every corner case.
1) Reverse group of elements in a linked list
2) perform push,pop and min operations of stack in O(1) time.

Some suggestions:
1) Practice on paper, don’t practice on the computer.
2) While practicing, we should try do the question our own then see the answer, don’t go directly to the answer.

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!