Hopscotch Hashing hashes elements to an index in an array, and stores it in that cell. It then searches for the nearest empty cell and starts a search in the nearby slot. If it doesn't find an empty cell within a certain range, it triggers a rehash that may increase the size of the array.