# Hash Table

`Hash Table` is a data structure which organizes data using `hash functions` in order to support quick insertion and search.

There are two different kinds of hash tables:- **Hash set** and **Hash map.**

* The `hash set` is one of the implementations of a `set` data structure to store `no repeated values`.
* The `hash map` is one of the implementations of a `map` data structure to store `(key, value)` pairs.

## **Contents:-**

{% content-ref url="hash-table/designing-a-hash-table" %}
[designing-a-hash-table](https://soumyajit4419.gitbook.io/ds-algo/hash-table/designing-a-hash-table)
{% endcontent-ref %}

{% content-ref url="hash-table/various-implementation-using-stl" %}
[various-implementation-using-stl](https://soumyajit4419.gitbook.io/ds-algo/hash-table/various-implementation-using-stl)
{% endcontent-ref %}
