DSAMotivator

Heaps / Priority Queue

Always know the min or max in O(log n) — the 'top K of anything' workhorse.

The idea

The full written guide for Heaps / Priority Queueis on its way. The practice progression below is live — it's the same curated, ordered list our users work through inside the app.

Practice progression

In this order, on LeetCode. Each one adds a wrinkle the previous one didn't have.

  1. 1#703 Kth Largest Element in a StreamEasy
  2. 2#1046 Last Stone WeightEasy
  3. 3#973 K Closest Points to OriginMedium
  4. 4#215 Kth Largest Element in an ArrayMedium
  5. 5#621 Task SchedulerMedium
  6. 6#295 Find Median from Data StreamHard
  7. 7#767 Reorganize StringMedium

Knowing the pattern is half the job. Showing up daily is the other half.

DSAMotivator tracks this exact progression — with streaks, XP, and a map that fills in as you go.

Start free — 7 days