Back to course home

0% completed

# Introduction to Two Heaps Pattern

In many problems, where we are given a set of elements such that we can divide them into two parts. To solve the problem, we are interested in knowing the smallest element in one part and the biggest element in the other part. This pattern is an efficient approach to solve such problems.

This pattern uses two **Heaps** to solve these problems; A **Min Heap** to find the smallest element and a **Max Heap** to find the biggest element.

Let’s jump onto our first problem to see this pattern in action.

.....

.....

.....

Like the course? Get enrolled and start learning!