# Category Archives: Heap

What is Heap? A Heap is a special Tree-based data structure in which the tree is a complete binary tree. There are two types of… Read More
What is Heap Data Structure? A Heap is a special Tree-based Data Structure in which the tree is a complete binary tree. Types of heaps:… Read More
Given an integer N which denotes the number of elements in a binary heap. Check if the binary Heap is completely filled or not. Examples:… Read More
Given an array arr[] of size N, the task is to find the minimum number of operations required to reduce all three elements of the… Read More
Given an array arr[] which is of 3*N size, the task is to remove N elements and divide the whole array into two equal parts… Read More
A Data Structure organizes and stores data in a computer so that we can perform operations on the data more efficiently. There are many diverse… Read More
Heap is a special tree-based data structure where the tree is always a complete binary tree. Heaps are of two types: Max heap and Min… Read More
Array: An array is a collection of similar data types which is stored in contiguous memory locations. Arrays are static data structures with limited size.… Read More
Given a number X, and an array arr[] of length N containing the N numbers. The task is to find the minimum number of operations… Read More
Given a rod of length L and an array arr[] of length N, the task is to find if it is possible to break the… Read More
Given an Array input[] consisting only of 1s initially and an array target[] of size N, the task is to check if the array input[]… Read More
Given a sentence S of size N where each word is a concatenation of a numeric part followed by a bunch of characters. The task… Read More
Given an array arr[] of size N where arr[i] is in the form [xi, yi] denoting a point (xi, yi) on a 2D plane. The… Read More
Given an array arr[] of size N, the task is to find the number of operations to convert array elements to zero by decrementing the… Read More
Given an array arr[] of N integers and an integer K, the task is to find the sum of maximum of the array possible wherein… Read More