First round: Phone call with recruiter.

Second round: General technical interview with hiring manager, discussing past projects and behavioral questions (e.g., "Tell me a time when you had to resolve conflict in your team"). The interview also covered languages.

Following this, a HackerRank test was administered, consisting of two medium-level LeetCode-style questions.

I did not hear back after completing the online assessment.

Given an array of post nums, find the maximum distance such that, starting with two pointers l and r at some position, l can only move left and r can only move right. Both pointers can only move if the next number is greater than or equal to the current number.

Examples: maxDist([2, 6, 8, 5]) == 3 maxDist([1, 5, 5, 2, 6]) == 4 maxDist([1, 1]) == 2 maxDist([1, 1, 1, 1, 1]) == 5 maxDist([2, 2, 2, 10, 1, 10, 2, 2, 2]) == 4 maxDist([2, 2, 2, 10, 1, 10, 2, 2]) == 4 maxDist([2, 10, 8, 4, 2, 1, 9, 10, 2]) == 7

Given two arrays, A and B, of the same length n, where A[i] and B[i] represent the time it costs to assemble a car part on line A and line B, respectively. Let X be the time it costs to move a car assembly from line A to line B for its next part. Let Y be the time it costs to move a car assembly from line B to line A for its next part. Find the minimum time to assemble a car.

Example: assemble([1, 6, 2], [3, 2, 5], 2, 1) == 8 (Because 1 + (2+2) + (2+1) = 8) A B A