I have 7 years of experience. Recruiter contacted me through Linked-In\n\nAttended just 2 out of 4 rounds\n**First Round** - \nGiven a tree and a number see if the sum of nodes from root to leaf add up to that number\nGiven a linked list reorder list such as all the odd nodes come in the beginning and even nodes go to the end(odd/even not by value but the position of the nodes)\n\t\t\t\t\t  \n\t\t\t\t\t  \n **Second Round**\n\tFind the length of the longest increasing Sub-Sequence.\n\t\t\t\t\t  \nRecruiter called and said I didn\'t do well in the second round. Hoping that some other opportunities come my way.

I have 7 years of experience. Recruiter contacted me through Linked-In\n\nAttended just 2 out of 4 rounds\nFirst Round - \nGiven a tree and a number see if the 