Arrays and searching 0/120

Lesson 6 of 9

Heaps

Keep the smallest item at hand with a binary heap, track the largest k values with a size-k min-heap, and keep a running median with two heaps.

4,723 words · 21 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 6

Further reading 3