← Back to Sunday Lessons

Heaps Part 2 — Top-K & CCC

Frequency counting, Top-K problems, and competitive programming practice

🏔️

Heaps Part 1 — Basics

Haven't done Part 1? Start with heap fundamentals and heapq

Heap Part 2 Exercises0/3
1📊

Top K Frequent Elements

Find the k most frequent elements using a min-heap of size k.

2🥉

CCC — Bronze Count

CCC J3: Find the 3rd highest score and count how many participants achieved it.

3🔨

Build a Heap from Scratch

Implement bubble up, bubble down, and heapify — no heapq allowed!