Hashing

Question 1

Cuckoo hashing (idea)

Answer 1

There are two arrays and different hash function for each. Each Time you insert a new element you try inserting into the first array with its hash function. If it is already taken “kick out” the existing element and take its place, try putting it into the second array using its hash function. Do this back and forth until all is settled.

Question 2

Cuckoo hashing (time complexity)

Answer 2

All dictionary operations are O(1) complexity.