Hash Tables - Data-Structures | CodeMentor

1What is the average and worst-case time complexity for lookup in a Hash Table?ExpertHigh

2What is a Hash Collision?ExpertHigh

3What is the difference between HashMap, TreeMap, and LinkedHashMap?ExpertHigh

4Why is the worst-case lookup O(n)? How do modern implementations avoid this? (Tree buckets)ExpertHigh

5What are the security implications of Hash Collision attacks (HashDoS)?ExpertHigh

6What is the Load Factor? How does it trigger a Rehash/Resize?ExpertHigh

7What is a Bloom Filter? When is it used? (Cache penetration, Spell check)ExpertHigh

8What is a Hash Table? What is a Key-Value pair?ExpertHigh

9What is a Cryptographic Hash? How does it differ from a regular hash?ExpertHigh

10How do you design a Hash Table from scratch?ExpertHigh

11What is a Hash Function? What makes a good hash function?ExpertHigh

12What is the significance of Equals() and GetHashCode() in C#/Java when using objects as keys?ExpertHigh

13What is Consistent Hashing? How is it used in Distributed Systems?ExpertHigh

14Explain Separate Chaining. (Buckets/Linked Lists)ExpertHigh

15Explain Open Addressing. (Linear Probing, Quadratic Probing, Double Hashing)ExpertHigh

16Why can't we use a Hash Table efficiently for Ordered operations (e.g., find min/max)?ExpertHigh

17Why is it bad to use a mutable object as a key in a HashMap?ExpertHigh