Python coding challenges: "heap"

All Easy Medium Hard

All Python Basics Strings & Text Lists & Arrays Dicts & Sets Functions & Closures OOP & Classes Data Structures & Algorithms Advanced Python Iterators & Generators Decorators & Context Managers Error Handling & Exceptions Regular Expressions Math & Number Theory Bit Manipulation Dynamic Programming Trees & Binary Trees Graphs & Graph Algorithms Recursion & Backtracking Greedy Algorithms Binary Search Two Pointers & Sliding Window Stacks & Queues Heaps & Priority Queues Linked Lists Matrix & 2D Arrays Datetime & Time Calculations Data Formats & Parsing SQL & SQLite Numpy & Vectorized Computing Cryptography & Hashing

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

+10 pts 15m

Heaps & Priority Queues easy

Last Stone Weight

Given an array of stone weights, repeatedly smash the two heaviest stones and return the last remaining weight or 0.

heap priority-queue simulation

+10 pts 15m

Showing 1–2 of 2 challenges · easy · 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.

Python Coding Challenges

Min Heap Class

Last Stone Weight

Heaps & Priority Queues — Python coding challenges

What you will find here

Challenges vs tutorials and quizzes

Python Coding
Challenges