I applied through an employee referral. The process took 1 week.

Applied through referral. I immediately got an invite to take an online assessment. You have a week to take the test including three parts:

• Coding challenge (2 HackerRank questions, 90min)
• System design - rating the effectiveness of potential actions (~15min, not timed)
• Work style - choose the extent to which a statement represents your work style (~10min, not timed)

The coding questions were horribly long to read.

You are given sum and n. You need to return the smallest lexicography permutation, that includes 1 to n, where each can be plus/minus, and their sum is equal to sum. The permutation needs to be lexicography sorted as well.

For example: n=5, sum=9. Permutations: [-1,-2,3,4,5], [1,2,-3,4,5].. Each sorted: [-2,-1,3,4,5], [-3,1,2,4,5].. Then return the smallest lexi out of all: [-3,1,2,4,5]

You are given locations array, which are (x,y) on a graph, that represent servers. And directions array, which are values 1-4, that represent the directions a request is routed.

When:

• 1 is (x,y)->(x+Z,y+Z)
• 2 is (x,y)->(x+Z,y-Z)
• 3 is (x,y)->(x-Z,y+Z)
• 4 is (x,y)->(x-Z,y-Z)

You need to start from locations[0], and route the request by following the direction steps. In each step, you need to route the request to the closest unvisited server. If there is no such, skip to the next step. Return the location at the end.