The recruiter emailed four days after I applied to schedule a phone interview.

The phone interview happened a week and a half later, on November 7.

The phone interview consisted of coding on a blank Google Doc. The question was: given an array of n integers, check if the array has two nearby duplicate numbers. This means if a[i] = x, check if x occurs at most two positions after i.

I started with a brute-force approach, which took a long time. With hints, I was able to get the program to run in O(n) time using a dictionary. I used C#.

Given an array of n integers, check if the array has two nearby duplicate numbers. This means if a[i] is equal to a[j] and the absolute difference between i and j is at most 2, then they are considered nearby duplicates.