Try this exercise. Click the correct answer from the options.
Which of the following is a solution for collisions in a hash table implementation?
Click the option that best answers the question.
- There is no good solution for collisions, the hash function must be unique
- Use separate chaining, often with a linked list, where the index of the array consists of a chain of values
- Use a trie to store values at every index
- Concatenate all the values as one single string at that bucket