Submit resume from amazon.com. Few weeks later got two phone interviews. The interviewer are very nice, the process went pretty smooth. Both call are much similar, give some algorithm problem, then code solution. Some question were: Find the next biggest number of given value in BST. Find a path to leaf in BST from which the total of the path equal to given number.