First of all I thank GeeksForGeeks for giving right direction in Making my dream true.
Got short listed from a consultancy and They have shared a link of Microsoft where I have to submit the online test.
Online test has 2 questions need to be completed in 1hour
- Did not remember
- BST Tree Inorder is given need to print all possible BST trees from the above tree which have same elements.
- String is given need to print maximum length of string ( sub string) which is not palindrome Solved o(n2) asked for optimization and code followed by test cases.
- Discussion on abstration and interfaces
- Double linked list swap pair wise data
- Double linked list swap pair wise links
- Test cases ( i told list can have bad links)
- verify for list is proper or not then loop detection
- discussion on projects
- tool kit of nuts and bolts need to find the matching pairs of all. given o(n2) asked for optimization and code.
- discussion on projects
- Compression algo for image data
- Thread synchronization for producer many consumers (extension of producer consumer problem)
- Find near to me restaurants approach ( told some approach using graphs which i also did not satisfy :) ).
- Server is replaced with MS server in place of MAC server then how MAC client can use MS services design ( told adapter way).