I was contacted initially by a recruiter and then set up two phone interviews. The process was quick and professional. You provide your preferences for phone interview dates and times, and they schedule appropriately. The interviewers seemed very helpful as well.

The interviews typically involve two stages:

• First, they ask you to explain your approach to solving a problem.
• Then, they ask you to code your solution.

They do provide helpful hints along the way.

Phone Interview 1:

• Find the maximum height of a BST. This was easy using recursion. The interviewer then asked me to solve it iteratively, which I managed to do.

• The Dutch flag problem. This was not difficult. However, the next question was challenging. It involved finding particular keys in a dictionary. They provided a custom function, isWord(x), that indicates whether a key exists in the dictionary. The goal was to determine if, for a given input string, we could reconstruct the original words from the dictionary.

For example:

The dictionary contains the words: {hi, hello, sir, how, are, you}

And you have a function isWord(x) that tells you if a particular word is in that dictionary.

If the input is hisirhowareyou, the output must be hi sir how are you.

I could not solve this problem. :(