Core Skill

• Maintain a heap of size k

Problems

• Kth Largest Element in an Array
• Top K Frequent Elements

Pattern

heap = []
for x in nums:
		heappush(heap,x)
		if len(heap) > k:
				heappop(heap)

Key Insight

• Use min heap of size k to track largest elements