Skip to main content
impol.dev

Search and Graphs

Binary search and heaps

Use sorted boundaries or heap order to avoid scanning every candidate.

Lesson 10/19

Sign in to watch

Sign in

Practice

Reference problems

Reference problems are premium

Premium unlocks the curated list of practice problems for this class.

Notes

Lesson text

Full notes are premium

Premium unlocks the full written notes.