1. Given 2 sorted arrays find the Kth smallest element in the merged array. 2. Given a Dictionary which as data like: { '1' : 'A', '2' : 'B', '3' : 'C', ...... '26' : 'Z'} input will be an integer, return all possible combination of values from the dictionary Ex: 5918 => EIAH, EIS EIAH is from 5 9 1 8 EIS is from 5 9 18 3. Given a sorted array find an element from the array 4. Given a sorted array convert the same to a Binary Search Tree 5. Given a list of sorted stream of objects, return the merged data. 6. Given a Binary Search Tree, and an input integer (PIVOT), partition the BST into two BST all elements greater than pivot will be one BST and all elements lesser than PIVOT will another BST. (you have to split BST and not re-create two separate BSTs).