Heap

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: Hash Map Sorting

Complexity Range

Time Complexity

O(n log n) (1 problem)

Space Complexity

O(n) (1 problem)

Problems Using Heap

Top K Frequent Elements

Returns the k most frequent elements in the array.

Medium LeetCode
Time: O(n log n)
Space: O(n)
Example: [1,1,1,2,2,3], k=2 → [1,2]
Hash Map Sorting Heap
View Solution →
← Back to All Patterns
View All Categories