1

Introduction to Priority Queues using Binary Heaps

2

Min Heap and Max Heap Implementation

3

Check if an array represents a min-heap or not

4

Convert min Heap to max Heap

1

Kth largest element in an array [use priority queue]

2

Kth smallest element in an array [use priority queue]

3

Sort K sorted array

4

Merge M sorted Lists

5

Replace each array element by its corresponding rank

6

Task Scheduler

7

Hands of Straights

1

Design twitter

2

Connect `n` ropes with minimal cost

3

Kth largest element in a stream of running integers

4

Maximum Sum Combination

5

Find Median from Data Stream

6

K most frequent elements