Only Code

C++ Standard Template Library (STL) – [Priority queue]

In the last post we discussed about C++ Standard Template Library (STL) Linked List. In this post we will learn about STL Priority queue and using it as Max/Min Heap. A priority queue is a data structure for maintaining a set of elements having an associated value.

C/C++, Heaps, Special Data Structures

C++ Standard Template Library (STL) – [Linked List]

The C++ Standard Template Library (STL) is a powerful library of C++ template classes that provide general-purpose classes and functions. It has implementations of many popular and commonly used algorithms and data structures like vectors, linked-lists etc.

C/C++, Linked Lists

Huffman Code Explained using Heap [Introduction to Algorithms book]

Huffman codes are a widely used technique for compressing data. Huffman codes is a greedy algorithm to build up an optimal way of representing each character as a binary string. Suppose we have a 10,000 character data file that we wish to store. And we observe a character ‘a’ occurs very frequently.

Greedy approach, Heaps

Only Code

Only Code

Only Code

C++ Standard Template Library (STL) – [Priority queue]

C++ Standard Template Library (STL) – [Linked List]

Huffman Code Explained using Heap [Introduction to Algorithms book]

Array Rotation

Find number of subarrays with given sum (with Negative numbers) – LeetCode Solution [Medium]

Find number of subarrays with given sum (positive numbers) [Sliding window]

Find maximum sum of contiguous subarray of size k [Sliding Window]

Subset with a given sum and number of subsets

Tower of Babylon Solution – SPOJ.com

Matrix-chain multiplication