Heaps & Priority Queues
easy
Min Heap Class
Build a MinHeap class with push, pop, peek, and size methods that maintain a valid min-heap.
heap
priority-queue
class
Heaps & Priority Queues
medium
Top K Frequent Elements
Given an integer array and a number k, return the k most frequent elements using a heap-based approach.
heap
frequency
counting
Showing 2 challenges · Heaps & Priority Queues
Heaps & Priority Queues — Python coding challenges
What you will find here
This page lists heaps & priority queues challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.