I submitted my resume at a career fair and received an email to set up a phone interview a week later.

The interviewer was nice. He introduced himself and his work before going into a technical question.

The first question was to determine whether an array contains a duplicate value.

The next part of the question was to determine whether there is a nearby duplicate in an array.

Unfortunately, I was rusty on my algorithm interview skills, so I did not pass and received a rejection email a few weeks later.

Write a function that is given an array of integers and an integer k. It should return true if and only if there are two distinct indices i and j into the array such that arr[i] == arr[j] and the difference between i and j is at most k.