DDSA Solutions

Hash Table

149 problems · 109 with full explanations

20 Easy78 Medium11 Hard
Hash tables provide O(1) average-case lookup, insert, and delete. They are the go-to tool for counting frequencies, detecting complements (Two Sum pattern), and caching seen values. In C#, use Dictionary<K,V> for maps and HashSet<T> for membership checks.

How to practice

To practice Hash Table problems effectively, start with the Easy problems listed below, trace through each solution on paper, then re-implement without looking. When you can recognise the hash table pattern within 30 seconds of reading a new problem, move on to Medium difficulty. Use the related topic pages and our study guide for a structured progression.

Open the full study guide →

Start here (Easy + explained)

All Hash Table problems