I applied online. The process took 3 weeks. I interviewed at Front (San Francisco, CA)
Interview
Phone screen, technical assessment, onsite with a whiteboardish type of problem(not too hard, they mostly are trying to see how you think). Make sure you write tests with the take-home challenge.
Interview questions [2]
Question 1
The goal is to find the smallest number (let's call it M) such that:
If M obeys property X, then the digit X is part of the number.
If M does not obey property X, then the digit X is NOT part of the number.
For example, if 2457 were a magic number, it would obey properties 2, 4, 5, 7 and not 0, 1, 3, 6, 8, 9. However we find that not to be the case, so it is not the number we are looking for.
Properties
0. One of the digits of M is the sum of the others.
1. Digits in decreasing sequence.
2. M has at least 2 odd digits.
3. All digits are different.
4. There is no subset in the digits with a sum of 4.
5. The number is not a palindrome.
6. The number does not contain 3 odd digits in a row.
7. M is a prime number.
8. M has at least 2 even digits in a row.
9. The product of all odd digits is a square number.
Define a general JSON representation for open hours
Imagine that you have a UI letting an administrator define open hours. What format should the API accept?
Implement responseTime() _
Write a function (in a language of you choosing): responseTime(time1, time2, openHours) where:
time1 and time2 are 2 UNIX timestamps.
openHours is the data structure you previously defined.
the returned value is the difference between time1 and time2, excluding time where the team was not available.
For example, with the previous example, responseTime(<monday 8am>, <monday 10am>, oh) would be only 1 hour.
Bonus: can you guess the format used in Front?