## Merge M sorted lists of variable length

Given M sorted lists of variable length, print them in sorted order efficiently.

Read More Merge M sorted lists of variable lengthCoding made easy

Given M sorted lists of variable length, print them in sorted order efficiently.

Read More Merge M sorted lists of variable lengthHuffman Coding is a algorithm for doing data compression and it forms the basic idea behind file compression. This post talks about fixed length and variable length encoding, uniquely decodable codes, prefix rules and construction of Huffman Tree.

Read More Huffman CodingGiven a string, find first K non-repeating characters in it by doing only single traversal of it. For example, if the string is ABCDBAGHCHFAC and K = 3, output would be D G F

Read More Find first k non-repeating characters in a string in single traversalExternal sorting is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory (usually a hard drive).

Read More External merge sortGiven M sorted lists each containing N elements, print them in sorted order efficiently.

Read More Merge M sorted lists each containing N elementsGiven M sorted lists of variable length, efficiently compute the smallest range that includes at-least one element from each list.

Read More Find smallest range with at-least one element from each of the given listsGiven an array and positive integer k, find k’th smallest element in the array.

Read More Find K’th smallest element in an arrayGiven 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.

Read More Sort K-Sorted ArrayGiven an array and positive integer k, find K’th largest element in the array.

Read More Find K’th largest element in an arrayGiven a array representing a Max Heap, in-place convert the array into the min heap in linear time.

Read More Convert Max Heap to Min Heap in linear timeGiven an array of integers, check if it represents Min-Heap or not.

Read More Check if given array represents min heap or notGiven an array of integers, sort it using heap sort algorithm.

Read More Heap Sort (Out-of-place and In-place implementation)Implement heap data structure.

Read More Min Heap and Max Heap Implementation in C++In this article, we will introduce a very important data structure Priority Queues and discuss how we can implement them using (Binary) Heaps.

Read More Introduction to Priority Queues using Binary Heaps