Find all the occurrences of a substring in a given string in C++
Given a string s1, find the occurrences of string s2 in s1.
Input: s1 = “onlycode”; s2 = “code”
Author: Logan
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++ 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.
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.
Array Rotation
Array rotation is a problem of changing the order of the elements of the array. Decreasing the index of the element by one and changing the index of the first element to n-1.
Find number of subarrays with given sum (with Negative numbers) – LeetCode Solution [Medium]
In the previous post, we discussed about finding the total number of continuous subarrays of a given array (of non-negative numbers) whose sum equals to k. In this post we’ll include negative numbers in the given array arr.
Find number of subarrays with given sum (positive numbers) [Sliding window]
Given an array of non-negative integers arr and an integer k, return the total number of continuous subarrays whose sum equals to k.
Find maximum sum of contiguous subarray of size k [Sliding Window]
You’re given an array of size N. You’ve to find the maximum sum obtained from a contiguous subarray of size k of the given array, where k <= N.
Subset with a given sum and number of subsets
You are given an array of non-negative integers, you have to find the number of subsets having sum equal to the given sum. Subset needs not to be contiguous.
Matrix-chain multiplication
We are given a sequence (chain) (M1, M2, M3…Mn) of n matrices to be multiplied and we need to find the most efficient way to multiply these matrices together.