Given a string with repeated characters, task is rearrange characters in a string so that no two adjacent characters are same. Note : It may… Read More »
In previous article, we have discussed about the concepts related to Binomial heap. Examples Binomial Heap: 12————10——————–20 / \ / | \ 15 50 70… Read More »
A Binary Heap is a Complete Binary Tree. A binary heap is typically represented as array. The representation is done as: The root element will… Read More »
Given an array of integers and two numbers k1 and k2. Find sum of all elements between given two k1’th and k2’th smallest elements of… Read More »
Given an array of digits (values are from 0 to 9), find the minimum possible sum of two numbers formed from digits of the array.… Read More »
Heap data structure can be implemented in a range using STL which allows faster input into heap and retrieval of a number always results in… Read More »
Given array representation of min Heap, convert it to max Heap in O(n) time. Input: arr = [3 5 9 6 8 20 10 12… Read More »
Prerequisite – Binary Heap K-ary heaps are a generalization of binary heap(K=2) in which each node have K children instead of 2. Just like binary… Read More »
Given a binary tree we need to check it has heap property or not, Binary tree need to fulfill following two conditions for being a… Read More »
Heaps are mainly used for implementing priority queue. We have discussed below heaps in previous posts. Binary Heap Binomial Heap In terms of Time Complexity,… Read More »
Given an array, how to check if the given array represents a Binary Max-Heap.
A typical Priority Queue requires following operations to be efficient. Get Top Priority Element (Get minimum or maximum) Insert an element Remove top priority element… Read More »
Given an infinite stream of integers, find the k’th largest element at any point of time.
Although QuickSort works better in practice, the advantage of HeapSort worst case upper bound of O(nLogn). MergeSort also has upper bound as O(nLogn) and works… Read More »
Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the… Read More »