Python coding challenges: "priority queue"

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 medium

Find K pairs with smallest sums

Given two sorted arrays and an integer k, return the k smallest pairs (u, v) with the smallest sums, sorted by sum.

heap priority queue two-sum

+25 pts 30m

Heaps & Priority Queues medium

Minimum Cost to Connect Sticks

Compute the minimum total cost to connect all sticks into one stick by repeatedly combining two sticks with the smallest lengths.

heap priority queue greedy

+25 pts 25m

Showing 1–2 of 2 challenges

Guide: free Python coding challenges

Practice Python by solving problems

PythonSkillset challenges are hands-on coding exercises from beginner to advanced. Open a challenge, read the problem, write Python in the split-pane editor, and run tests with Pyodide — no install required.

How to use the arena

Pick a category — basics, algorithms, strings, and more
Open a challenge, read the statement, and edit the starter code
Run tests, fix failures, then try a related quiz or tutorial lesson

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