Given a k-sorted array that is almost sorted such that each of the N elements may be misplaced by no more than k positions from the correct sorted order. Find a space-and-time efficient algorithm to sort the array.
Given an array and positive integer k, find K’th largest element in the array.
Given an array representing a Max Heap, in-place convert the array into the min heap in linear time.
Given an array of integers, check if it represents min heap or not.
Given an array of integers, sort it using heap sort algorithm in C, C++ and Java.
Implement heap data structure.
In this article, we will introduce a very important data structure Priority Queues and discuss how we can implement them using (Binary) Heaps.
Given a huge set of strings with duplicate strings present, find first k-maximum occurring words in it.
Given a source vertex s from set of vertices V in a weighted graph where all its edge weights w(u, v) are non-negative, find the shortest-path weights d(s, v) from given source s for all vertices v present in the graph.