Microsoft Interview Questions
- 5of 5 votes
AnswersYou have a link list with the following structure:
- francisco.gutierrez.91 January 24, 2013 in United States for Office
struct Node{ Node*next; Node*other; }
next pointer points to next node, but "other" pointer points to any node in the list, it can be itself or null.
you receive the header of a list with this structure.
you have to copy it(allocate new memory) , you cannot modify the structure, you can not modify the list you are given.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Linked Lists Algorithm Data Structures - 1of 3 votes
AnswersTell me about another project you have done, how did you do it? what are de difficult parts of it?, tell me everything
- francisco.gutierrez.91 January 24, 2013 in United States for Office| Report Duplicate | Flag | PURGE
Microsoft Experience - 0of 0 votes
AnswersTest a program that receives 3 inputs (the size of each edge of a triangle). the program should return :
- francisco.gutierrez.91 January 24, 2013 in United States for Office
1 for equilateral
2 for isoceles
3 for scaleno
0 for not triangle
you have to give several test cases for the program| Report Duplicate | Flag | PURGE
Microsoft Testing - 0of 0 votes
AnswersYou receive a string with the following characters: '{' '(' '[' ']' ')' '}'
- francisco.gutierrez.91 January 24, 2013 in United States for Office
the string can be any size, any number of each character.
You have to decide if the string is balanced, for examplo
{()[]} - correct
(({)}) - incorrect
{()) - incorrect| Report Duplicate | Flag | PURGE
Microsoft Algorithm - -1of 1 vote
AnswerMicrosoft recruiting final round:
- francisco.gutierrez.91 January 24, 2013 in United States for Office
Interview 1-Question 4:
Tell me about any software you like, how would you improve it? what bugs have you found?, how would you solve those bugs?| Report Duplicate | Flag | PURGE
Microsoft General Questions and Comments - 0of 0 votes
AnswersMicrosoft recruiting final round:
- francisco.gutierrez.91 January 24, 2013 in United States for Office
Interview 1-Question 3:
Tell me about your projects what problems have you had and how did you solve them| Report Duplicate | Flag | PURGE
Microsoft Experience - 1of 1 vote
AnswersMicrosoft recruiting final round:
- francisco.gutierrez.91 January 24, 2013 in United States for Office
Interview 1-Question 2:
How would you test an elevator| Report Duplicate | Flag | PURGE
Microsoft Testing - 0of 0 votes
AnswersMicrosoft recruiting final round:
- francisco.gutierrez.91 January 24, 2013 in United States for Office
Interview 1-Question 1:
Insert node in a sorted singly linked list| Report Duplicate | Flag | PURGE
Microsoft Linked Lists - 0of 0 votes
AnswersGiven a BST, how would you return the nth smallest element. The code had to cover all the edge cases and was expected to write a logn solution
- pradeep1288 January 19, 2013 in United States| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer C - 0of 0 votes
AnswersYou have a vending machine with some inventory. write a program to help vending machine tender exact change to the customer.
- praveen January 11, 2013 in United States for Bing-Appex| Report Duplicate | Flag | PURGE
Microsoft Intern - 0of 0 votes
AnswersFind successor in a BST with duplicate values allowed.
- praveen January 11, 2013 in United States for Bing-Appex| Report Duplicate | Flag | PURGE
Microsoft Intern - 1of 1 vote
AnswersReverse Linked list in parts iteratively.
- praveen January 11, 2013 in United States for Bing-Appex
ex 1->2->3->4->5->6->7->8 and if 'parts' is 3.
o/p = 3->2->1->6->5->4->8->7.| Report Duplicate | Flag | PURGE
Microsoft Intern - 1of 1 vote
AnswersWrite a program that reverses alternate elements in a given linked list input: a->b->c->d->e, output should be b->a->d->c->e
- yash1990singla January 04, 2013 in India| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer - 0of 0 votes
AnswersGiven two strings find if they are anagrams or not.
- yash1990singla January 04, 2013 in India
eg.
"tom marvolo riddle" and "i am lord voldemort".
(The example added the other constraint that the whitespaces donot matter.)| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm - 0of 2 votes
AnswersRound 3 :
- sonesh January 03, 2013 in India
Q 6 : You are given a ternary tree (a tree with 3 children at max with left, middle, right pointer at each node), create a singly linked list from it without using extra space ?| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Data Structures Linked Lists Trees and Graphs - 3of 3 votes
AnswersRound 3 :
- sonesh January 03, 2013 in India
Q 5 : You are given a binary search tree, and a value(data item), you need to tell the left most right cousin in as minimum time and as minimum space ?(need to minimize actual time complexity, he need minimum order of complexity as well as number of node access should be minimum)| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Data Structures Trees and Graphs - -3of 7 votes
AnswersRound 3 :
- sonesh January 03, 2013 in India
Q 1 : How are you ?
Q 2 : Do you want to go for MS or PHD ?
Q 3 : What type of branch is yours ?(actually my branch name is mathematics and computing, and after 3 year Microsoft allowed our branch to appear for placement, so they ask this question)
Q 4 : One question is from my project “Garbage cleaner Robot” ?| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer General Questions and Comments - -1of 1 vote
AnswersRound 2 :
- sonesh January 03, 2013 in India
Q 3 : you are given some nodes, and for each node a probability is given which will tell its importance, you need to design an efficient data structure such that the expected search time as minimum as possible. (Hint : Use dynamic programming + binary tree).| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Dynamic Programming Trees and Graphs - 0of 0 votes
AnswersRound 2 :
- sonesh January 03, 2013 in India
Q 2 : You are given finitely many intervals in 1D, you have to design a data structure an efficient data structure which can answer queries of the form “In how many intervals the point P belong ?”, P is an input point, and all intervals are closed. I answer B tree(think why) which is most efficient.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Data Structures Dynamic Programming Probability Trees and Graphs - -1of 1 vote
AnswersRound 2 :
- sonesh January 03, 2013 in India
Q 1 : You are the supervisor of an airport. What happens is that visitors are not visit your airport, instead they go to another one, which means your airport become unpopular nowadays, Now as a supervisor you need to find out what has happens ?, What went wrong ?,How do you find out ?, What is correct ?, How do you find correct one and at what cost ?| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Behavioral Data Mining Data Structures Experience Ideas Probability Application / UI Design - 0of 0 votes
AnswersRound 1 :
- sonesh January 03, 2013 in India
Q 3 : What do you think, how the posts in Facebook are shown, to your page, as there are thousands of posts, likes, videos, images, links etc. shared by your friends, but not all are shown to you ? (Data mining question, have to tell appropriate solution which can work ?)| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Data Mining Data Structures - 2of 2 votes
AnswersRound 1 :
- sonesh January 03, 2013 in India
Q 2 : longest palindrome in a string ? (Need to tell in O(n) time complexity + O(1) space complexity)| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Coding Dynamic Programming String Manipulation - 0of 0 votes
AnswersRound 1 :
- sonesh January 03, 2013 in India
Q 1 : When you visit on your friend’s Facebook profile, there is a mutual friend section where common friends are listed, now let’s assume that your friend do the same thing, he/she visit his/her friend other then you, now the people other than common are connected to you by distance of two. Similarly think you are given two people on Facebook, how do you find this connectivity?. (Please give appropriate solution),
Now let’s think that some important people are given some weight(any), now do the same thing ?
Now calculate the most influential person? (Not an easy question, because of weights) ?| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm Data Mining Data Structures Trees and Graphs - 0of 0 votes
AnswersGiven a board of snakes and ladders game, provide an algorithm to find the minimum number of dice rolls required from 1 to 50 and maximum number of dice rolls required from 51 to 100.
- ritesh.bajaj6 December 26, 2012 in India
Note: Consider snake bite and ladder up condition from the board.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm - 0of 0 votes
AnswersSuppose you have given a tree with N nodes and weights associated with each node and edges are given(present in the tree).You have to remove two edges such that the sum of weights of three trees created is maximum.
- ritesh.bajaj6 December 26, 2012 in India| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm - 2of 2 votes
AnswersWrite a function to reverse the word order of String. Do this in-place. "This is a cat" -> "cat a is This". Spaces between words may not be consistent.
- Evan December 25, 2012 in United States| Report Duplicate | Flag | PURGE
Microsoft - 1of 1 vote
Answersdesign Malloc Function which user can call and get the allocation. For example, there is a Byte array of byte[1000] so if use call getAllocation(3) then we will assign 3 bytes to user. and again if another user call getAllocation(100) then we will assign again,
- Andy2000 December 22, 2012 in United States for STB| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 1of 1 vote
AnswersGiven the two arrays with integers, return the common elements
- Evan December 20, 2012 in United States| Report Duplicate | Flag | PURGE
Microsoft - 0of 0 votes
AnswersFor a string with uneven number of white spaces, what is best method or algorithm to trim the white spaces between characters, except special characters like !or,
- mrinalkamboj December 18, 2012 in India for Bing
Also the beginning and end should not contain any white space| Report Duplicate | Flag | PURGE
Microsoft Tech Lead Algorithm - 2of 2 votes
AnswersGiven a 2D array of size m X n, containing either 1 or 0. As we traverse through, where ever we encounter 0, we need to convert the whole corresponding row and column to 0, where the original value may or may not be 0. Now devise an algorithm to solve the problem minimizing the time and space complexity.
- mrinalkamboj December 18, 2012 in India for Bing| Report Duplicate | Flag | PURGE
Microsoft Tech Lead Algorithm