## Min Heap(paid)

CONCEPTS USED: Heaps. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N integers, your task is to create a min-heap using the elements of the given array and print...

Skip to content
## Min Heap(paid)

## Heap Operations(paid)

## Small Group

## Fascinating Multiple Number

## Swap Sum

## Remove Kth element from Min Heap

## Print first K non-repeating characters of a string

## Heap Sort

## Minimum Difference

## Kth Largest element

CONCEPTS USED: Heaps. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N integers, your task is to create a min-heap using the elements of the given array and print...

CONCEPTS USED: Heaps. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N integers, your task is: To create min-heap(Insert elements one by one). Extract the minimum element from the...

Concepts Used Heap Difficulty Level Hard Problem Statement : Given an array of N integers, we want to know whether it is possible to divide the students into contiguous groups...

Concepts Used Heap Difficulty Level Medium Problem Statement : Given an array A of size N, we have to perform following operations, untill only one integer remains (N-1 times) :...

Concepts Used Heap Difficulty Level Medium Problem Statement : We are given N elements with an integer S. We want to find such a sub-array that has the maximum possible...

Concepts Used : Heap Difficulty Level : Easy Problem Statement : Given an array containing N integers, our task is to: Create min-heap with 1 based indexing. Remove the element...

Concepts Used: Heap Difficulty Level: Hard Problem Statement : Given a string str, find first K non-repeating characters in lexicographical order, if all the characters are repeating then print "Not...

Concepts Used: Heap Difficulty Level: Easy Problem Statement : Given an array containing N integers, our task is to create a min-heap using the elements of the given array and...

Concepts Used Heap Difficulty Level: Hard Problem Statement : Given N sectors and two integers P and Q, our task is to find Q closest sectors to P sector. See...

Concepts Used Heap Difficulty Level Hard Problem Statement : Given the heights of N buildings and an integer k find the height of kth highest building. See original problem statement...