DSA Patterns · Week 8
Heaps: min/max, push/pop in O(log n), heapify in O(n)
00:00
DSA Patterns • Week 8
01 / 13

Heaps: min/max, push/pop in O(log n), heapify in O(n)

K-th anything, streaming medians, always-cheapest-first — reach for a heap.

StackShade deck
COURSE CONTENTS

Heaps: min/max, push/pop in O(log n), heapify in O(n)

01How This Journey WorksDay 0 · 4 topics0/4
02Complexity, Arrays & HashingWeek 1–2 · 11 topics0/11
03Two PointersWeek 2–3 · 7 topics0/7
04Sliding WindowWeek 3–4 · 8 topics0/8
05StackWeek 4 · 8 topics0/8
06Binary SearchWeek 5 · 8 topics0/8
07Linked ListWeek 5–6 · 10 topics0/10
08TreesWeek 6–7 · 13 topics0/13
09TriesWeek 7 · 4 topics0/4
10Heap / Priority QueueWeek 8 · 8 topics0/8
11BacktrackingWeek 8–9 · 11 topics0/11
12GraphsWeek 9–10 · 17 topics0/17
131-D Dynamic ProgrammingWeek 10–11 · 14 topics0/14
142-D Dynamic ProgrammingWeek 11–12 · 11 topics0/11
15Greedy, Intervals & BitsWeek 12 · 12 topics0/12
16Mock Interviews & Mixed RevisionWeek 13 · 6 topics0/6