Learning Path
Blogs
Premium
Login
Send
Hide Index
Heap
0% completed
Introduction
What's the problem?
A possible solution
What is a heap?
Supported operations
Implementation
Structure
Insert
Delete
Peek
Extract
Construct
Tree heap validator
Pattern: Kth element
Kth largest element
K most frequent elements
K smallest sum pairs
K sorted array sorting
K arrays smallest range
Pattern: Data stream
Design a kth largest finder
Design a median finder
Pattern: Conversion
BST to min heap
Min heap to max heap
Max heap to min heap
Pattern: Design
Design a min heap
Design a max heap
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Start a
FREE
trial to continue learning.
Start free trial