1. Online coding assessment
2. Spoke to HR
3. Technical phone screen
4. In-person 5-hour technical round
5. Spoke to team lead and CTO

Overall, the experience was great. The company works on interesting projects, and everyone was very respectful throughout all rounds of the interview process. The questions were of medium difficulty and not unreasonable.

Declined the offer to pursue another opportunity.

You are building a speech engine. One component of the engine is to properly construct a sentence with regards to net worth. For example: "He has (a/an) $X net worth". Given any X, in string form, determine whether the sentence above should be completed with 'a' or 'an'.

For example:

Input: 8 Output: An

Input: 11,000 Output: An

Given three groups of values, in the form of (Key, Value), generate all possible combinations of these values. For instance:

Input: ((“Number”, “1”), (“Number”, “2”), (“Letter”, “A”), (“Number”, “3”), (“Color”, “Red”), (“Letter”, “B”))

Output: ((“1”, “A”, “Red”), (“1”, “B”, “Red”), (“2”, “A”, “Red”), (“2”, “B”, “Red”), (“3”, “A”, “Red”), (“3”, “B”, “Red”))

Create a big integer class that supports three operations:

• void operator++()
• BigInteger(u_int32)
• bool operator>(const BigInteger&)

Given an hour and minute, find the smallest angle between the hour and minute hands on a clock.

Determine the balance point of a vector of integers. A vector of integers is considered balanced if, at a given index in the vector, the sum of all numbers to the left of the index is equal to the sum of all numbers to the right of the index. Both sums do NOT include the value at the index.

Should be solved in O(n) time and O(1) space.

Write a function that takes the root of a binary tree and the head of a linked list. This function returns true if there is a consecutive downwards path to the elements of the linked list in the tree, false otherwise.

Given a string, find the leftmost character that never appears in the string only once.