Interview Question for Software Developer at Google:

Questions in first round: Write a method to pretty print a binary tree. Don't make any assumptions, i.e. the tree could be highly unbalanced. Given a dictionary segment a piece of un-spaced text to find meaningful words. e.g "makemytrip"->make my trip