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… Read More »
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… Read More »
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 »
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… Read More »
Consider the following algorithm for building a Heap of an input array A.
Given a team of N players. How many minimum games are required to find second best player?
Heap Data Structure is generally taught with Heapsort. Heapsort algorithm has limited uses because Quicksort is better in practice. Nevertheless, the Heap data structure itself… Read More »
Question: Write an efficient program for printing k largest elements in an array. Elements in array can be in any order.