Heap Problems

Practise 30 heap problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers top-k selection, merging sorted lists, running medians, scheduling with priority queues and greedy choices with a heap. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Basics: 7 easy problems such as Kth Loudest Live, Heap-Shaped Check and Two Cups a Second.
• Core Problems: 17 medium problems such as Most Talked About, Halve the Piles and Median in Linear Time.
• Hard Problems: 6 hard problems such as City Outline, Rising Tide Swim and Best Equation Value.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.