Phone interview with Seattle office. The manager called over the phone and asked about my experience. Initially, the interviewer said the interview would be for 45 minutes and ended up spending more than 20 minutes on my experience. After that, he switched to coding with an initial discussion about differences between BSTs and HashTables. Later, with the actual interview question, he made me hurry up in proposing a solution and coding because he was going to be kicked out of the conference/private room and he still had to write feedback.

Given two lists of numbers and an integer k, return the k smallest pairs of integers from the two lists. After proposing some initial brute-force solutions, the problem was simplified to be two sorted lists.