heap

Stop re-sorting your list. Python’s heapq gives you a min-heap that finds the smallest element in O(1) time. Learn heaps, priority queues, and when to use each — with real examples.