GLOBAL SCHOLAR

1 First Round:
PART A:
10 Technical Rounds.....
PART B:
5 Algorithm Qns

1. Something related to Merging of two binary trees..... and so on..... I am not sure.......
2. In a NxN matrix rotate all values 90 degrees..(First row become last column...... and so on....) Answer is in Cracking coding interview book chapter 1.
3. In a single linked list, given M and N ( two integer values...)
              Divide the linked list into M groups and delete first N nodes in each group.
              Ex: 1->2->3->4->5->6->7->8->9
              M=2, N=3
              Result:  4->5->9
               i.e., gropus 1....5,  6....9. N = 3. So delete first 3 nodes in each group
4. A sorted array is circularly shifted some arbitary number of times.... Find an element in O(log n) complexity
5. A program will be given. Find  cases in which it will not work. Change the code to incorporate those changes.

2nd Round:
1. In a given string, find if there exist any substring that is a palindrome...
Ex: abccd-> "cc" palindrome
       adcdbe-> "dcd" palindrome

2. In a binary tree, there can be two types of nodes, B and R. Delete all B nodes that does not have a R descendant.i.e, if There is a B node and it doesnot have any R node(not necessarily child, it can be child's child and so on....) below it, then that B node should be deleted.

3rd Round :

C++, OS, Complier Design, TOC, DB basic technicals.
Vertical Summation of Binary tree..

4th Round:

HR........ Casual talk.... My plus and MINUS asked...