Python coding challenges: "sorted"

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

Kth Largest Element in an Array (Heap Edition)

Implement a function that returns the kth largest element in an unsorted integer array using a heap.

heap priority-queue array

+20 pts 25m

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

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.

Python Coding Challenges

Kth Largest Element in an Array (Heap Edition)

Find K pairs with smallest sums

Heaps & Priority Queues — Python coding challenges

What you will find here

Challenges vs tutorials and quizzes

Python Coding
Challenges