Introduction

Counter is a specialized dictionary subclass from Python's built-in collections module, designed to count hashable objects. You feed it an iterable (or a mapping), and it produces a dictionary-like object where each element is a key and its count is the value. It turns tedious manual tallying loops into a single, readable line and adds powerful helpers like most_common() and arithmetic between counters.

Real-World Analogy

Prerequisites

Getting Started

Import Counter and pass it any iterable to count its elements instantly.

from collections import Counter

fruits = ["apple", "banana", "apple", "cherry", "banana", "apple"]
count = Counter(fruits)

print(count)              # Counter({'apple': 3, 'banana': 2, 'cherry': 1})
print(count["apple"])     # 3
print(count["mango"])     # 0  (missing keys return 0, no KeyError)

Ways to Create a Counter

from collections import Counter

print(Counter("mississippi"))       # Counter({'i': 4, 's': 4, 'p': 2, 'm': 1})
print(Counter({"a": 3, "b": 1}))    # Counter({'a': 3, 'b': 1})
print(Counter(a=2, b=5))            # Counter({'b': 5, 'a': 2})

Essential Counter Methods

Finding the Most Common Elements

The star feature — instantly rank elements by frequency.

from collections import Counter

words = "the quick brown fox the lazy dog the end".split()
count = Counter(words)

print(count.most_common(2))   # [('the', 3), ('quick', 1)]
print(count.most_common())    # all, sorted high -> low

Expanding with elements()

elements() reverses the counting — it produces each item repeated by its count.

from collections import Counter

c = Counter(a=3, b=2, c=0, d=-1)
print(list(c.elements()))   # ['a', 'a', 'a', 'b', 'b']

Counter Arithmetic

Counters support +, -, & (intersection), and | (union).

from collections import Counter

a = Counter(x=3, y=1)
b = Counter(x=1, y=2, z=4)

print(a + b)   # Counter({'z': 4, 'x': 4, 'y': 3})  add counts
print(a - b)   # Counter({'x': 2})                  keep positive only
print(a & b)   # Counter({'x': 1, 'y': 1})          minimum (intersection)
print(a | b)   # Counter({'z': 4, 'x': 3, 'y': 2})  maximum (union)

update() and subtract()

from collections import Counter

c = Counter(["a", "b"])
c.update(["a", "c", "c"])       # add more counts
print(c)   # Counter({'a': 2, 'c': 2, 'b': 1})

c.subtract(["a", "a", "a"])     # remove counts (may go negative)
print(c)   # Counter({'c': 2, 'b': 1, 'a': -1})

Real Example: Word Frequency

A classic use — count word frequency in a block of text.

from collections import Counter
import re

text = """the sun is bright the sky is blue
the sun is warm and the sky is clear"""

words = re.findall(r"\w+", text.lower())
freq = Counter(words)

for word, n in freq.most_common(3):
    print(f"{word}: {n}")
# the: 4
# is: 4
# sun: 2

Why It's Efficient

Building a Counter from an iterable of \(n\) elements is a single pass, giving linear time complexity:

\[ T_{\text{build}} = O(n) \]

Finding the top \(k\) elements with most_common(k) uses a heap, costing about:

\[ T_{\text{top-}k} = O(n \log k) \]

Both are far better than repeatedly scanning the data with manual counting loops.

Counter vs Plain dict

Best Practices

Common Mistakes

Interview Questions

Quick Revision