I was contacted by a recruiter on LinkedIn, who later called me and informally discussed the position they were looking for and asked about my background. After this phone call, the recruiter scheduled an hour-long technical phone interview with two software engineers based on my availability, which happened to be two weeks after this initial phone call from the recruiter.

The technical phone screen was conducted using Collabedit. First, the interviewer asked about my background and what my favorite project was that I had worked on. Then, the technical questions began. He said that, depending on the time, two coding questions would be asked, and we had enough time for both questions plus extra time for me to ask them questions. I coded my answers in C++.

I was notified three days after the phone screen that they would not be moving forward with me.

Implement double pow(double a, int b) without using any already built-in functions (aka, don't use an already defined pow function).

Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Remapping a letter means replacing all occurrences of it with another letter while the ordering of the letters remains unchanged. No two letters may map to the same letter, but a letter may map to itself.

Example: Given "foo", "app"; returns true we can map 'f' -> 'a' and 'o' -> 'p'

Given "bar", "foo"; returns false we can't map both 'a' and 'r' to 'o'

Given "turtle", "tletur"; returns true we can map 't' -> 't', 'u' -> 'l', 'r' -> 'e', 'l' -> 'u', 'e' -> 'r'

Given "ab", "ca"; returns true we can map 'a' -> 'c', 'b' -> 'a'