Latest Microsoft Interview Questions
Given a Parent -Child binary tree ,build the child -sibling version of it? Minimize the space requirements wherever possible. Given a binary tree build a linked list of all its nodes such that the nodes of a level appear before the nodes of the next level? Given an infinite stream of bits with the bits being appended at the highest significant position. give an algorithm to to say whether the number formed by using the sequence of bits that had been processed till then, is divisible by 3 or not? Given a string S of words and no of character per line m ,with m being greater than the longest word in S,print S in a set of lines so that each line contains no more than m characters and no word split between 2 lines. Given an expression remove the unnecessary brackets in it with out creating an ambiguity in its execution.
input output
ex1: (a+(b)+c) a+b+c
ex2: (a*b)+c a*b+c Propose a tree based data structure to identify a node with nth rank with maximum efficiency . Given a string S of alphabets and 2 characters a,b find the minimum distance between instances of them such that position of a <= position of b. Given an array of size n with first l positions filled with characters and a string s ,replace all the instances of ’%’ with this string s,given that the length of the array is sufficient to handle these substitutions.
input output
eg: abcdef%ghi%—— and “ppp” abcdefpppghippp Given a binary tree verify whether it is a binary search tree or not? Write a C code to merge 2 binary search trees and do the same 2 merge linked lists.How is the former different when compared to the later.(Discuss the issues) Tags: Interview, Microsoft, Question
This entry was posted
on Monday, May 11th, 2009 at 7:53 pm and is filed under Articles.
You can follow any responses to this entry through the RSS 2.0 feed.You can leave a response, or trackback from your own site.
Subscribe to our blog through our RSS feed or email to receive updates on more posts like this. post on your favourite social networking or media site to let others know about this post. Help us generate more buzz by submitting/voting for this post with the following buttons.
