Home/Lessons/DSA/Heaps + Priority Queues — the O(log n) sorted-ish structure← All lessonsAdvanced·12 min·dsa · heap · priority-queue · heapq · interviewHeaps + Priority Queues — the O(log n) sorted-ish structureLoading lesson…← PreviousEdit Distance — 2D DP on a gridNext →Tries — the prefix tree behind autocomplete