heapq — Easy Playground

Heap queue algorithm (priority queue) on plain lists

Python Playground

import heapq

# Min-heap operations
nums = [5, 1, 8, 3, 9, 2, 7]
heapq.heapify(nums)
print(f"Heap: {nums}")
print(f"Smallest: {heapq.heappop(nums)}")
print(f"3 largest: {heapq.nlargest(3, [5, 1, 8, 3, 9])}")

Output

Click "Run" to execute your code

The heapq module is part of Python's standard library. Heap queue algorithm (priority queue) on plain lists.

Challenge

Try modifying the code above to explore different behaviors. Can you extend the example to handle a new use case?

View all Easy examples for heapq