Design

Question 1

What are different methods of handling collision in hash map?

Answer 1

http://kamalmeet.com/algorithms/hashmap-collision-handling-using-chaining-and-open-addressing/
Separate chaining and open addressing.

Question 2

What is chaining in hashtable?

Answer 2

https://www.educative.io/edpresso/what-is-chaining-in-hash-tables
Chaining is a technique used for avoiding collisions in hash tables.

Question 3

What is bloom filter?

Answer 3

Its the replacement of hash Set. Hash Set has O(1) time but O(n) space complexity.
Bloom filter can achieve O(1) lookup in O(1) space complexity. However bloom filter can give false positive but can’t give false negatives
For example bloom filter tell us that value already exist but its actually not exist . However if bloom filter tells that value does not exist than it is guaranteed that value does not exist