When two different items have the same hash and we want to insert them in the hash table (that is an char[][] here), we have a collision. We have to insert that item in the nearest empty slot (the book says). Now think we have a word "sia" that has a hash== 23 and we have also another word "track" that has the same hash code. The array[23] is filled with "sia" and array[24] is empty. So "track" will be placed there.
Now what if we get a word for example "chance" with the hash equal to 24? It will replace "track"! Is this behavior usual in this kind of hash tables?
