Collections Module in Python0%

Collections Module in Python

Intermediate8 min read•Updated: 2026-10-01

The Collections Module in Python

Python's built-in general-purpose containers—dict, list, set, and tuple—are versatile, but certain high-performance algorithmic tasks demand specialized data structures. The collections module provides high-performance container alternatives that eliminate boilerplate and dramatically optimize time complexity.

1. The Core Containers in `collections`

1collections
├── Counter        # Frequency tracker for hashable objects
├── defaultdict    # Dictionary with automatic default value factory
├── deque          # Double-ended queue with O(1) pops and appends at both ends
├── namedtuple     # Factory for creating tuple subclasses with named fields
├── OrderedDict    # Dictionary preserving order with reordering methods
└── ChainMap       # View for searching multiple dictionaries as one

2. `namedtuple`: Readable, Lightweight Records

Tuples access values by numeric indices (p[0], p[1]), which hurts readability. namedtuple assigns field names to each position while maintaining tuple immutability and near-zero memory overhead compared to full class instances:

1from collections import namedtuple
2 
3# Define schema
4Point = namedtuple("Point", ["x", "y", "label"])
5 
6# Instantiate
7p1 = Point(12, 25, "NodeA")
8 
9# Access by field name OR numeric index
10print(f"Label: {p1.label}, Coordinates: ({p1.x}, {p1.y})")
11print(p1[0])  # 12 (Indexable like a tuple)
12 
13# Immutability preserved
14# p1.x = 99  # AttributeError: can't set attribute

3. `deque`: Double-Ended Queue ($O(1)$ Performance)

In Python, a standard list is a contiguous dynamic array. Calling list.pop(0) or list.insert(0, val) has an expensive $O(n)$ time complexity because every subsequent element must be shifted in memory.

A deque (pronounced "deck") is implemented as a doubly linked list of blocks, guaranteeing $O(1)$ instantaneous operations from both the left and right ends:

1from collections import deque
2 
3queue = deque(["Task1", "Task2", "Task3"], maxlen=4)
4 
5# Fast O(1) operations on both ends
6queue.append("Task4")          # Append right
7queue.appendleft("PriorityTask") # Prepend left (Evicts Task4 because maxlen=4!)
8 
9print(list(queue))
10# Output: ['PriorityTask', 'Task1', 'Task2', 'Task3']
11 
12# Fast O(1) removals
13first = queue.popleft()  # 'PriorityTask'
14last = queue.pop()       # 'Task3'
15print(f"Remaining: {list(queue)}")

4. `Counter`: High-Speed Frequency Counting

Counter is a dictionary subclass specifically designed for counting items and analyzing distributions:

1from collections import Counter
2 
3words = ["apple", "banana", "apple", "orange", "banana", "apple", "mango"]
4counts = Counter(words)
5 
6print(counts)
7# Output: Counter({'apple': 3, 'banana': 2, 'orange': 1, 'mango': 1})
8 
9# Direct lookup of non-existent key returns 0 instead of KeyError!
10print(counts["grapes"])  # 0
11 
12# Retrieve top N most frequent elements
13top_two = counts.most_common(2)
14print("Top 2:", top_two)  # [('apple', 3), ('banana', 2)]
15 
16# Arithmetic between counters
17c1 = Counter(a=3, b=1)
18c2 = Counter(a=1, b=2)
19print("Combined:", c1 + c2)  # Counter({'a': 4, 'b': 3})

5. `defaultdict`: Eliminating `KeyError`

A standard Python dictionary raises a KeyError when accessing a key that does not exist. A defaultdict automatically invokes a callable factory function (such as list, int, or set) to initialize missing keys on first access:

1from collections import defaultdict
2 
3# 1. Grouping items into lists
4grouped_students = defaultdict(list)
5 
6records = [("CS", "Aarav"), ("EE", "Priya"), ("CS", "Rohan"), ("ME", "Vikram")]
7 
8for department, student in records:
9    # No need to write: if department not in grouped_students: grouped_students[department] = []
10    grouped_students[department].append(student)
11 
12print(dict(grouped_students))
13# Output: {'CS': ['Aarav', 'Rohan'], 'EE': ['Priya'], 'ME': ['Vikram']}
14 
15# 2. Integer counter factory
16word_counts = defaultdict(int)
17for char in "mississippi":
18    word_counts[char] += 1  # Missing keys initialize to int() -> 0
19print(dict(word_counts))

6. Data Structure Decision Matrix

Use Case	Best Structure	Why?
First-In-First-Out (FIFO) queue	`collections.deque`	$O(1)$ `popleft()` vs $O(n)$ in `list`
Frequency tallying / histogram	`collections.Counter`	Built-in arithmetic & `.most_common()`
Grouping items by key	`collections.defaultdict(list)`	Eliminates manual existence checks
Lightweight immutable record	`collections.namedtuple`	Clean dot-notation with tuple efficiency

⚠️ Common Intermediate Mistakes & Gotchas

1. Modifying a `defaultdict` via Read Operations

Accessing a missing key in a defaultdict automatically creates that key with the default factory! If you only want to inspect without inserting, use standard .get() or in.

2. Mutating `namedtuple` Attributes

namedtuple instances are immutable, just like standard tuples. Attempting to reassign an attribute directly raises an AttributeError. Use ._replace() to create a modified copy.

💻 Try It Yourself: Word Frequency Counter with Counter

Scenario

Use collections.Counter to parse a paragraph of text, eliminate punctuation, and display the top 3 most frequently occurring words.

Complete Solution

1from collections import Counter
2import re
3 
4text = """
5Python is high-level, interpreted, and powerful. Python is widely used in data science,
6machine learning, and web development. Learning Python opens infinite programming doors.
7"""
8 
9# Extract clean words
10words = re.findall(r"w+", text.lower())
11counter = Counter(words)
12 
13print("Top 3 most frequent words:")
14for word, count in counter.most_common(3):
15    print(f"- '{word}': {count} occurrences")

Expected Output

1Top 3 most frequent words:
2- 'python': 3 occurrences
3- 'and': 3 occurrences
4- 'is': 2 occurrences

Interactive Quiz• Knowledge Check

Practice Quiz

Question 1

What is the time complexity of removing an item from the beginning of a collections.deque using popleft()?

Question 2

What happens when you query a key that has not been added to a collections.Counter?

Question 3

Which factory function passed to defaultdict allows appending elements to missing keys without initialization?

Question 4

What is a key advantage of namedtuple over a standard dictionary for fixed records?

Question 5

What happens when you append an element to a deque that has already reached its configured maxlen?

🚀 What's Next?

In the next lesson, we will continue your intermediate Python journey with OS and Sys Modules (10: Python Standard Libraries).

👉 Continue to Next Lesson: OS and Sys Modules →

Next Lesson

OS and Sys Modules

Continue learning with hands-on practice, examples, and exercises in the upcoming topic.

Related Lessons

Previous Lesson	Next Lesson
Datetime Module	OS and Sys Modules

Practice Quiz

Test your understanding of this lesson with 5 questions. Each question has one correct answer.

Previous Next

PreviousPrevNext

MSK Institute • Shikohabad

Loading Page Content...

Preparing courses, live labs, and learning resources.सामग्री लोड हो रही है, कृपया प्रतीक्षा करें...

Connecting serverPlease wait...

💻 Practical Labs🚀 Free Demo📜 Verified Certificates

OS and Sys Modules

Collections Module in Python

Intermediate8 min read•Updated: 2026-10-01

Study Materials Cheatsheet

The Collections Module in Python

1. The Core Containers in `collections`

1collections
├── Counter        # Frequency tracker for hashable objects
├── defaultdict    # Dictionary with automatic default value factory
├── deque          # Double-ended queue with O(1) pops and appends at both ends
├── namedtuple     # Factory for creating tuple subclasses with named fields
├── OrderedDict    # Dictionary preserving order with reordering methods
└── ChainMap       # View for searching multiple dictionaries as one

2. `namedtuple`: Readable, Lightweight Records

1from collections import namedtuple
2 
3# Define schema
4Point = namedtuple("Point", ["x", "y", "label"])
5 
6# Instantiate
7p1 = Point(12, 25, "NodeA")
8 
9# Access by field name OR numeric index
10print(f"Label: {p1.label}, Coordinates: ({p1.x}, {p1.y})")
11print(p1[0])  # 12 (Indexable like a tuple)
12 
13# Immutability preserved
14# p1.x = 99  # AttributeError: can't set attribute

3. `deque`: Double-Ended Queue ($O(1)$ Performance)

A deque (pronounced "deck") is implemented as a doubly linked list of blocks, guaranteeing $O(1)$ instantaneous operations from both the left and right ends:

1from collections import deque
2 
3queue = deque(["Task1", "Task2", "Task3"], maxlen=4)
4 
5# Fast O(1) operations on both ends
6queue.append("Task4")          # Append right
7queue.appendleft("PriorityTask") # Prepend left (Evicts Task4 because maxlen=4!)
8 
9print(list(queue))
10# Output: ['PriorityTask', 'Task1', 'Task2', 'Task3']
11 
12# Fast O(1) removals
13first = queue.popleft()  # 'PriorityTask'
14last = queue.pop()       # 'Task3'
15print(f"Remaining: {list(queue)}")

4. `Counter`: High-Speed Frequency Counting

Counter is a dictionary subclass specifically designed for counting items and analyzing distributions:

1from collections import Counter
2 
3words = ["apple", "banana", "apple", "orange", "banana", "apple", "mango"]
4counts = Counter(words)
5 
6print(counts)
7# Output: Counter({'apple': 3, 'banana': 2, 'orange': 1, 'mango': 1})
8 
9# Direct lookup of non-existent key returns 0 instead of KeyError!
10print(counts["grapes"])  # 0
11 
12# Retrieve top N most frequent elements
13top_two = counts.most_common(2)
14print("Top 2:", top_two)  # [('apple', 3), ('banana', 2)]
15 
16# Arithmetic between counters
17c1 = Counter(a=3, b=1)
18c2 = Counter(a=1, b=2)
19print("Combined:", c1 + c2)  # Counter({'a': 4, 'b': 3})

5. `defaultdict`: Eliminating `KeyError`

1from collections import defaultdict
2 
3# 1. Grouping items into lists
4grouped_students = defaultdict(list)
5 
6records = [("CS", "Aarav"), ("EE", "Priya"), ("CS", "Rohan"), ("ME", "Vikram")]
7 
8for department, student in records:
9    # No need to write: if department not in grouped_students: grouped_students[department] = []
10    grouped_students[department].append(student)
11 
12print(dict(grouped_students))
13# Output: {'CS': ['Aarav', 'Rohan'], 'EE': ['Priya'], 'ME': ['Vikram']}
14 
15# 2. Integer counter factory
16word_counts = defaultdict(int)
17for char in "mississippi":
18    word_counts[char] += 1  # Missing keys initialize to int() -> 0
19print(dict(word_counts))

6. Data Structure Decision Matrix

Use Case	Best Structure	Why?
First-In-First-Out (FIFO) queue	`collections.deque`	$O(1)$ `popleft()` vs $O(n)$ in `list`
Frequency tallying / histogram	`collections.Counter`	Built-in arithmetic & `.most_common()`
Grouping items by key	`collections.defaultdict(list)`	Eliminates manual existence checks
Lightweight immutable record	`collections.namedtuple`	Clean dot-notation with tuple efficiency

⚠️ Common Intermediate Mistakes & Gotchas

1. Modifying a `defaultdict` via Read Operations

Accessing a missing key in a defaultdict automatically creates that key with the default factory! If you only want to inspect without inserting, use standard .get() or in.

2. Mutating `namedtuple` Attributes

namedtuple instances are immutable, just like standard tuples. Attempting to reassign an attribute directly raises an AttributeError. Use ._replace() to create a modified copy.

💻 Try It Yourself: Word Frequency Counter with Counter

Scenario

Use collections.Counter to parse a paragraph of text, eliminate punctuation, and display the top 3 most frequently occurring words.

Complete Solution

1from collections import Counter
2import re
3 
4text = """
5Python is high-level, interpreted, and powerful. Python is widely used in data science,
6machine learning, and web development. Learning Python opens infinite programming doors.
7"""
8 
9# Extract clean words
10words = re.findall(r"w+", text.lower())
11counter = Counter(words)
12 
13print("Top 3 most frequent words:")
14for word, count in counter.most_common(3):
15    print(f"- '{word}': {count} occurrences")

Expected Output

1Top 3 most frequent words:
2- 'python': 3 occurrences
3- 'and': 3 occurrences
4- 'is': 2 occurrences

Interactive Quiz• Knowledge Check

Practice Quiz

Question 1

What is the time complexity of removing an item from the beginning of a collections.deque using popleft()?

Question 2

What happens when you query a key that has not been added to a collections.Counter?

Question 3

Which factory function passed to defaultdict allows appending elements to missing keys without initialization?

Question 4

What is a key advantage of namedtuple over a standard dictionary for fixed records?

Question 5

What happens when you append an element to a deque that has already reached its configured maxlen?

🚀 What's Next?

In the next lesson, we will continue your intermediate Python journey with OS and Sys Modules (10: Python Standard Libraries).

👉 Continue to Next Lesson: OS and Sys Modules →

Next Lesson

OS and Sys Modules

Continue learning with hands-on practice, examples, and exercises in the upcoming topic.

Related Lessons

Previous Lesson	Next Lesson
Datetime Module	OS and Sys Modules

Practice Quiz

Test your understanding of this lesson with 5 questions. Each question has one correct answer.

Previous Next

The Collections Module in Python

1. The Core Containers in collections

2. namedtuple: Readable, Lightweight Records

3. deque: Double-Ended Queue ($O(1)$ Performance)

4. Counter: High-Speed Frequency Counting

5. defaultdict: Eliminating KeyError

6. Data Structure Decision Matrix

⚠️ Common Intermediate Mistakes & Gotchas

1. Modifying a defaultdict via Read Operations

2. Mutating namedtuple Attributes

💻 Try It Yourself: Word Frequency Counter with Counter

Scenario

Complete Solution

Expected Output

Practice Quiz

🚀 What's Next?

OS and Sys Modules

Related Lessons

Practice Quiz

Loading Page Content...

The Collections Module in Python

1. The Core Containers in collections

2. namedtuple: Readable, Lightweight Records

3. deque: Double-Ended Queue ($O(1)$ Performance)

4. Counter: High-Speed Frequency Counting

5. defaultdict: Eliminating KeyError

6. Data Structure Decision Matrix

⚠️ Common Intermediate Mistakes & Gotchas

1. Modifying a defaultdict via Read Operations

2. Mutating namedtuple Attributes

💻 Try It Yourself: Word Frequency Counter with Counter

Scenario

Complete Solution

Expected Output

Practice Quiz

🚀 What's Next?

OS and Sys Modules

Related Lessons

Practice Quiz

1. The Core Containers in `collections`

2. `namedtuple`: Readable, Lightweight Records

3. `deque`: Double-Ended Queue ($O(1)$ Performance)

4. `Counter`: High-Speed Frequency Counting

5. `defaultdict`: Eliminating `KeyError`

1. Modifying a `defaultdict` via Read Operations

2. Mutating `namedtuple` Attributes

1. The Core Containers in `collections`

2. `namedtuple`: Readable, Lightweight Records

3. `deque`: Double-Ended Queue ($O(1)$ Performance)

4. `Counter`: High-Speed Frequency Counting

5. `defaultdict`: Eliminating `KeyError`

1. Modifying a `defaultdict` via Read Operations

2. Mutating `namedtuple` Attributes