Given an infinite stream of integers, find the k’th largest element at any point of time.
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 given array.
The main application of Binary Heap is as implement priority queue. Binomial Heap is to extension of Binary Heap that provides faster union or merge operation together with other operations provided by Binary Heap.
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.
There are given n ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths.
Given k sorted arrays of size n each, merge them and print the sorted output.
Design a Data Structure for the following operations. The data structure should be efficient enough to accommodate the operations according to their frequency.
Given N machines. Each machine contains some numbers in sorted form. But the amount of numbers, each machine has is not fixed. Output the numbers from all the machine in sorted non-decreasing form.
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 log k) time.
Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no duplicates. For example, let us consider the stream 5, 15, 1, 3 … After reading 1st element of stream – 5 -> median – 5 After reading 2nd element of… Read More »
Consider the following algorithm for building a Heap of an input array A.