Maximums from array when the maximum decrements after every access
Given an integer K and an array of integers arr, the task is to find the maximum element from the array and after every retrieval… Read More »
Category Archives: Heap
Sum and product of k smallest and k largest composite numbers in the array
Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »
Sum and product of k smallest and k largest prime numbers in the array
Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »
Average of max K numbers in a stream
Given a list of ‘N’ numbers, and an integer ‘K’. The task is to print the average of max ‘K’ numbers after each query where… Read More »
Find the k smallest numbers after deleting given elements
Given an array of integers, find the k smallest numbers after deleting given elements. In case of repeating elements delete only one instance in the… Read More »
Find the k largest numbers after deleting the given elements
Given an array of integers, find the k largest number after deleting the given elements. In case of repeating elements, delete one instance for every… Read More »
Memory representation of Binomial Heap
Prerequisites: Binomial Heap Binomial trees are multi-way trees typically stored in the left-child, right-sibling representation, and each node stores its degree. Binomial heaps are collection… Read More »
Fibonacci Heap – Deletion, Extract min and Decrease key
In the last post, we discussed Insertion and Union of Fibonacci Heaps. In this post, we will discuss Extract_min(), Decrease_key() and Deletion() operations on Fibonacci… Read More »
Fibonacci Heap – Insertion and Union
Prerequisites:Fibonacci Heap (Introduction) Fibonacci Heap is a collection of trees with min-heap or max-heap property. In Fibonacci Heap, trees can can have any shape even… Read More »
Maximum element in min heap
Given a min heap, find the maximum element present in the heap. Examples: Input : 10 / \ 25 23 / \ / \ 45… Read More »
Minimum element in a max heap
Given a max heap, find the minimum element present in the heap. Examples: Input : 100 / \ 75 50 / \ / \ 55… Read More »
Sort a nearly sorted array using STL
Given an array of n elements, where each element is at most k away from its target position, devise an algorithm that sorts in O(n… Read More »
Where is an object stored if it is created inside a block in C++?
There are two parts of memory in which an object can be stored: stack – Memory from the stack is used by all the members… Read More »
Python Code for time Complexity plot of Heap Sort
Prerequisite : HeapSort Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we… Read More »
Priority Queue in Python
Priority Queue is an extension of the queue with following properties. 1) An element with high priority is dequeued before an element with low priority.… Read More »
