Skip to content

Tag Archives: min-heap

A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Since a heap is a complete binary tree,… Read More
Given an array of intervals arr[] of size N, the task is to find the Kth smallest element among all the elements within the intervals… Read More
Given a two dimensional array arr[][] of dimensions N * 2 which contains the starting and ending time for N meetings on a given day.… Read More
Priority Queue is an extension of the queue with the following properties:   Every item has a priority associated with it. An element with high priority… Read More
Given an integer N denoting number of jobs and a matrix ranges[] consisting of a range [start day, end day] for each job within which… Read More
Given a positive integer M and two arrays arr[] and value[] of N and K positive integers respectively, the task is to add every element… Read More
A Min Heap is a Complete Binary Tree in which the children nodes have a higher value (lesser priority) than the parent nodes, i.e., any… Read More
Given an array arr[] and an integer K, the task is to find the number of merge operation required such that all the elements of… Read More
Given an array of jobs with different time requirements, where each job consists of start time, end time and CPU load. The task is to… Read More