First Journey (Microsoft)

Micrsoft

ShortList->Written test1->written test2->

1. In a given string remove all duplicates of length N, modify the original string
2. convert BST into Doubly linked list. Do not copy the data.
3. given 1 -1000 bottles out of them one is poisonous. In how many number of steps we can find poisonous bottle

1. Add the two numbers represented in linked list form
2. Find the maximum weighted node in a binary tree
maximum weight = data at node* level from the root