Learning Path
Blogs
Premium
Login
Feedback
Hide Index
Heap
0% completed
Introduction to heaps
Understanding the problem
Exploring a possible solution
Understanding a heap
Types of heaps
Overview of supported operations
Tree heap validator
Array implementation of heaps
Structure of array based heap
Inserting an item in the heap
Deleting an item from the heap
Peeking the top item in the heap
Extracting the top item from the heap
Constructing a heap
Min heap to max heap
Max heap to min heap
Pattern: Top K elements
Understanding the top k elements pattern
Identifying the top k elements pattern
Kth largest element
new
Kth smallest element
new
K range sum
K sorted array sorting
Pattern: Comparator
Understanding comparators
Understanding the comparator pattern
Identifying the comparator pattern
K most frequent elements
K smallest sum pairs
K closest values
K arrays smallest range
K-way list merge
Design
Design a max heap
Design a min heap
Design a median finder
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Check our
discounted
plans to continue learning.
Subscribe