When retrieving values from a hash table with linear probing, how do we know if the wanted value had not been shifted?
With linear probing, the appropriate bucket stores both the value and the literal key. So when retrieving, you start in the bucket determined by the hash code and check if the key is the same. If it's not, you move to the next one and check again, and repeat until you find what you're looking for.