Contacted by a recruiter, I scheduled a phone interview after a couple of weeks.

She set up a technical interview.

The interviewer was very hard to understand and did not explain the problem well. When I asked for clarification on certain parts, I couldn't understand him.

He only asked one question, which you will see below.

Unlikely to get a callback.

Given two sorted input arrays, each containing two-element arrays of [key, value], write a function that multiplies the two arrays together and sums the results where the key matches.

Example: v1 = [[1, 3], [2, 4], [99, 3]] v2 = [[2, 3], [5, 9], [99, 1]]

This example results in 15.

I first brute-forced it with O(n*m) complexity. Then I used two pointers, which resulted in O(n+m) complexity. He then asked me to write it in O(n log m). I could not think of an algorithm for O(n log m) at the time.