Analyst Integration Question: Download Integration Programmer PDF
Explain couple of ways to resolve collision in hash table?
Answer:
Linear probing, double hashing, and chaining. In linear probing, if bucket is already occupied then function check next bucket linearly until it find an empty one, while in chaining, multiple elements are stored in same bucket location.
| Previous Question | Next Question |
| Explain about unit testing? | Explain stateless system? |