Phone Interview 1: (1)Find maximum height of BST. This is easy using recursion. Then he asked me to do it iteratively, which I somehow managed to solve. (2)The Dutch flag problem. This was not tough. But the next question was tough. It was about finding particular keys in a dictionary. They have a custom function that tells you if a key is in the dictionary and you to find out if for given input, you get required output. For example -- The dictionary is like: {hi,hello,sir,how, are, you} And you have a function isWord(x) that tells you if a particular word is in that dictinary. So if the input is hisirhowareyou the output must be hi sir how are you I couldn't solve this problem. :(
