I found this Q in glassdoor while I am preparing for Google.

If you have an endless chess board, and two knights on fields (x,y) and (x1,y1) calculate the minimum number of steps in which they meet.

Since there are 2 knights, bit confused about this question. Is it similar like one knight to reach another destination?