What useful types does the collections module provide?

Question

Accepted Answer

The **`collections`** module provides specialized container types that extend the built-in list/dict/tuple with convenient, often more efficient alternatives for common patterns. Knowing them lets you write cleaner, faster code.

## defaultdict — dicts with automatic default values

```python
from collections import defaultdict

# ❌ without it — must check/initialize keys manually
groups = {}
for item in items:
    if item.category not in groups:
        groups[item.category] = []
    groups[item.category].append(item)

# ✅ defaultdict auto-creates the default for missing keys
groups = defaultdict(list)        # missing key → a new empty list
for item in items:
    groups[item.category].append(item)   # no existence check needed
```

`defaultdict(list)` (or `int`, `set`, etc.) supplies a default for any missing key — eliminating the tedious check-and-initialize pattern. Great for grouping and counting.

## Counter — count occurrences

```python
from collections import Counter

c = Counter("mississippi")         # Counter({'i': 4, 's': 4, 'p': 2, 'm': 1})
c.most_common(2)                    # [('i', 4), ('s', 4)] — top 2
c["x"]                              # 0 — missing keys return 0, no error

Counter(["a", "b", "a", "c", "a"])  # count list items → {'a': 3, 'b': 1, 'c': 1}
```

`Counter` makes tallying frequencies trivial — counting words, votes, occurrences — with handy methods like `most_common`.

## deque — fast appends/pops at BOTH ends

```python
from collections import deque

q = deque([1, 2, 3])
q.append(4)          # add to the right
q.appendleft(0)      # add to the LEFT — O(1) (a list's insert(0) is O(n)!)
q.popleft()          # remove from the left — O(1)
q = deque(maxlen=3)  # bounded — auto-drops old items (sliding window)
```

`deque` is a double-ended queue with O(1) appends/pops at both ends — ideal for queues, stacks, and sliding windows (a plain list is O(n) for front operations).

## namedtuple — lightweight, named records

```python
from collections import namedtuple

Point = namedtuple("Point", ["x", "y"])
p = Point(3, 4)
p.x, p.y          # 3, 4 — access by NAME (clearer than p[0], p[1])
p                 # Point(x=3, y=4) — readable
```

`namedtuple` gives tuples named fields — more readable than index access, immutable, memory-efficient. (Modern code often uses `@dataclass` instead for mutable records.)

## OrderedDict / ChainMap (less common now)

```text
OrderedDict → ordered dict (less needed since regular dicts keep order in 3.7+)
ChainMap    → search multiple dicts as one (e.g. layered config/defaults)
```

## Why it matters

The `collections` module provides the right tool for common patterns, leading to cleaner and often more efficient code. `defaultdict` and `Counter` dramatically simplify grouping and counting (replacing verbose manual logic); `deque` gives O(1) double-ended operations where a list would be slow; `namedtuple` makes readable lightweight records.

Reaching for these instead of hand-rolling the same patterns with plain dicts/lists is a mark of idiomatic, performant Python — they're widely used in real code for data processing, algorithms, and clean APIs.