Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn Python programming
·
Module 8
Heaps and Priority Queues
1
Heap Operations with Python's `heapq` Module
Perform heap operations (push, pop, heapify) using Python's heapq module
2
Implementing Priority Queues with `heapq`
Implement a priority queue using the heapq module
3
Solving Top-K Problems with Min-Heaps
Solve Top-K element problems using a min-heap
4
Median in a Data Stream
Find the median in a data stream using two heaps
5
Efficiently Merging K Sorted Arrays with Heaps
Merge K sorted arrays efficiently using a heap
6
Max-Heap Implementation with `heapq` and Negation
Implement a max-heap using Python's heapq by negating values
Previous module
Backtracking
Next module
Binary Trees and Traversals