What is a dictionary/map and how does it differ from a set?

Question

Accepted Answer

A **dictionary** (map, associative array) stores **key → value** associations, letting you look up a value by its key in **average O(1)**. A **set** is essentially a map with keys but no values — it stores membership only.

## Example

```python
# Counting word frequencies — a classic map use
text = "the cat the dog the".split()
counts = {}
for word in text:
    counts[word] = counts.get(word, 0) + 1
# counts -> {'the': 3, 'cat': 1, 'dog': 1}

ages = {'alice': 30, 'bob': 25}
ages['alice']          # O(1) lookup by key -> 30
ages['carol'] = 40     # O(1) insert
'bob' in ages          # O(1) key membership
```

## Set vs map

| | Set | Map / Dict |
|---|---|---|
| Stores | unique keys | key → value pairs |
| Lookup | "is key present?" | "what value for key?" |
| Use | membership, dedup | associations, counting |

| Operation | Average |
|---|---|
| insert / update | O(1) |
| lookup | O(1) |
| delete | O(1) |

## Why it matters

Maps are the everyday workhorse for indexing data by an identifier — caches, configuration, frequency counts, and grouping.

Modern dictionaries (e.g. Python 3.7+) also preserve insertion order, combining fast access with predictable iteration.

	Set	Map / Dict
Stores	unique keys	key → value pairs
Lookup	"is key present?"	"what value for key?"
Use	membership, dedup	associations, counting