ConceptTheory & Algos
2D peak finding
An algorithmic problem of finding a peak in a 2D matrix, where a peak is greater than or equal to its neighbors.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.