Phone Interview\n\n1) - Given 2 arrays and an element X, Find two elements, one from each array which would sum to X.\n2) - Given a Binary Tree, Check whether the Tree is a BST.\n\nFirst Online Round:\n\n1) - Given a set of numbers, Generate all Subsets of the numbers.\n2) - Given Start and End Timings of Meetings. Find the minimum number of rooms required to accomodate the meetings.\n\n\nSecond Online Round:\n\n1) - Given a String, Compress and remove all occurrences of all characters which occur more than 3 times consecutively.\n\neg: AABBBCC  becomes AACC\n       AABBCCCBB  becomes AABBBB which inturn becomes AA\n\t   \n2) - Find the first non repeating Character of a String\n    eg: Bloomberg. should return \'l\' as output.\n\t\n\t\n\tI could not solve the generate subsets problem and that led to my rejection I think.

Phone Interview\n\n1) - Given 2 arrays and an element X, Find two elements, one from each array which would sum to X.\n2) - Given a Binary Tree, Check whether t