D E Shaw

1. Rotate a matrix by 90 degrees (clockwise or anticlockwise or both)

2. Given an inorder and preorder traversal of the tree find the postorder of the tree. You can assume the tree is a binary tree. 

                                                                  MICROSOFT

1. Test cases for test and replace feature of Notepad

2. We are given an array of size n as input. We have to construct an output array such that the   i th index (0<=i<=n-1) of the output array must consist of multiplication of all numbers in the input array except the number in the i th index.
                  The division operator should not be used. 
                    
                   Write elegant, robust, clear code. Marks will be given based on the time and space complexities of your algorithm

3. We need to construct a library package for manipulation of numbers of digits of sizes 100000. Manipulation includes adding, subtracting, multiplication and division.