# 02_Hash Maps and Sets

# Hash Cheatsheet

As some might know sets in python can contain only unique elements. “Similar to hash table, a hash set is also a collection of objects. In hash table, data was stored in the form of key-value pairs, whereas in hash sets, the data is stored as objects. A hash set internally uses the hash table data structure to store data items. Just like a set, a hash set also does not allow storage of duplicate elements.”

Hashing is the most common example of a space-time tradeoff. Instead of linearly searching an array every time to determine if an element is present, which takes O(n) time, we can traverse the array once and hash all the elements into a hash table.

<table id="bkmrk-basic-hashset%C2%A0-hashm"><thead><tr><th>Basic</th><th>HashSet </th><th>HashMap </th></tr></thead><tbody><tr><th>Implements </th><td>Set interface </td><td>Map interface </td></tr><tr><th>Duplicates</th><td>No </td><td>Yes duplicates values are allowed but no duplicate key is allowed </td></tr><tr><th>Dummy values </th><td>Yes </td><td>No</td></tr><tr><th>Objects required during an add operation</th><td>1</td><td>2</td></tr><tr><th>Adding and storing mechanism </th><td>HashMap object </td><td>[Hashing](https://www.geeksforgeeks.org/what-is-hashing/) technique </td></tr><tr><th>Speed</th><td>It is comparatively slower than HashMap</td><td>It is comparatively faster than HashSet because of hashing technique has been used here.</td></tr><tr><th>Null </th><td>Have a single null value </td><td>Single null key and any number of null values</td></tr><tr><th>Insertion Method</th><td>Only one value is required for the insertion process. Add() function is used for insertion</td><td>Two values are required for the insertion process. Put() function is used for insertion.</td></tr><tr><th>Data storage</th><td>The data is stored as objects.</td><td>The data is stored as key-value pair.</td></tr><tr><th>Complexity</th><td>O(n) </td><td>O(1)</td></tr></tbody></table>

# Hash Functions



# Hash Map

```python
# Creating a hash table to store fruits based on their first letter
hash_table = {}
hash_table['A'] = 'Apple'
hash_table['B'] = 'Banana'
hash_table['O'] = 'Orange'

# Accessing a fruit based on its first letter
print(hash_table['A'])  # Output: 'Apple'
print(hash_table['B'])  # Output: 'Banana'
print(hash_table['O'])  # Output: 'Orange'
```

[![char_counting.gif](http://159.223.197.234/uploads/images/gallery/2025-03/char-counting.gif)](http://159.223.197.234/uploads/images/gallery/2025-03/char-counting.gif)

# Hash Set

```python
Example regular set:

# Regular Set (Without Hashing)
my_set = {3, 7, 1, 9, 5}

# Searching for an element in the set
search_element = 7
if search_element in my_set:
    print("Element found in the set!")
else:
    print("Element not found in the set.")

------------------------------------------------------
Example hashset:

# Hash Set (With Hashing)
my_hash_set = set()

# Adding elements to the hash set
my_hash_set.add(3)
my_hash_set.add(7)
my_hash_set.add(1)
my_hash_set.add(9)
my_hash_set.add(5)

# Searching for an element in the hash set
search_element = 7
if search_element in my_hash_set:
    print("Element found in the hash set!")
else:
    print("Element not found in the hash set.")
```