Recently, I misinterpreted a question and provided an incorrect solution to a problem. Can, I mark it in any way just like we have "duplicate" questions?

Suppose that array $A$ contains $n$ integers $a_1,a_2,a_3,\ldots,a_n$ and array $B$ contains $m$ integers. We know that $m \geq n$. What's the fastest algorithm to determine if there exists an integer $k$ such that $a_1+k,a_2+k,a_3+k,\ldots,a_n+k$ is a subset of array $B$? The elements need not...