# Category Archives: Heap

## heapq in Python to print all elements in sorted order from row and column wise sorted matrixNovember 7, 2017

Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order. Examples:… Read More »

## Smallest Derangement of SequenceNovember 6, 2017

Given the sequence find the lexicographically smallest (earliest in dictionary order) derangement of . A derangement of S is as any permutation of S such… Read More »

## Merge two sorted arrays in Python using heapqNovember 1, 2017

Given two sorted arrays, the task is to merge them in a sorted manner. Examples: Input : arr1 = [1, 3, 4, 5] arr2 =… Read More »

## Largest Derangement of a SequenceOctober 29, 2017

Given any sequence , find the largest derangement of . A derangement is any permutation of , such that no two elements at the same… Read More »

## Leaf starting point in a Binary Heap data structureOctober 26, 2017

Binary Heap is a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left… Read More »

## Minimum product of k integers in an array of positive IntegersOctober 15, 2017

Given an array of n positive integers. We are required to write a program to print the minimum product of k integers of the given… Read More »

## K-th Largest Sum Contiguous SubarrayOctober 6, 2017

Given an array of integers. Write a program to find the K-th largest sum of contiguous subarray within the array of numbers which has negative… Read More »

## Print all nodes less than a value x in a Min Heap.September 19, 2017

Given a binary min heap and a value x, print all the binary heap nodes having value less than the given value x. Examples :… Read More »

## Adding elements of an array until every element becomes greater than or equal to kAugust 24, 2017

We are given a list of N unsorted elements, we need to find minimum number of steps in which the elements of the list can… Read More »

## std::make_heap() in C++ STLAugust 15, 2017

make_heap() is used to transform a sequence into a heap. A heap is a data structure which points to highest( or lowest) element and making… Read More »

## Leftist Tree / Leftist HeapAugust 2, 2017

A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s-value (or rank… Read More »

## Median of Stream of Running Integers using STLJuly 14, 2017

Given that integers are being read from a data stream. Find median of all the elements read so far starting from the first integer till… Read More »

## Merge k sorted linked lists | Set 2 (Using Min Heap)July 6, 2017

Given k sorted linked lists each of size n, merge them and print the sorted output. Examples: Input: k = 3, n = 4 list1… Read More »

## Largest triplet product in a streamJune 27, 2017

Given a stream of integers represented as arr[]. For each index i from 0 to n-1, print the multiplication of largest, second largest, third largest… Read More »

## Find k numbers with most occurrences in the given array

Given an array of n numbers and a positive integer k. The problem is to find k numbers with most occurrences, i.e., the top k… Read More »