## String Range Queries to find the number of subsets equal to a given String

Given a string S of length N, and M queries of the following type: Type 1: 1 L x, Indicates update Lth index of string… Read More »

- Shortest Path Faster Algorithm
- Count the number of words with given prefix using Trie
- Check if given words are present in a string
- Minimum Cost Graph
- Count number of increasing sub-sequences : O(NlogN)
- Design a data structure that supports insert, delete, getRandom in O(1) with duplicates
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Ackermann Function
- Design a Queue data structure to get minimum or maximum in O(1) time
- Paranthesis Theorem
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- Types of Tries
- XOR of elements in a given range with updates using Fenwick Tree
- Maximum CPU Load from the given list of jobs
- Sum and Maximum of elements in array from [L, R] before and after updates
- Build a segment tree for N-ary rooted tree
- Range Sum and Update in Array : Segment Tree using Stack
- Query to find the maximum and minimum weight between two nodes in the given tree using LCA.
- Find K-th smallest element in an array for multiple queries
- Counting Inversions using Ordered Set and GNU C++ PBDS
- Check if a Tree can be split into K equal connected components
- Binary Array Range Queries to find the minimum distance between two Zeros
- Count of elements in an Array whose set bits are in a multiple of K
- Static and Dynamic data structures in Java with Examples
- Array Range Queries to find the Maximum Armstrong number with updates
- Count of distinct colors in a subtree of a Colored Tree with given min frequency for Q queries
- Queries to search an element in an array and move it to front after every query
- Count of different groups using Graph
- Queries for the count of even digit sum elements in the given range using Segment Tree.
- Count all sub-strings with weight of characters atmost K

Given a string S of length N, and M queries of the following type: Type 1: 1 L x, Indicates update Lth index of string… Read More »

Given an array arr[] of N integers and Q queries. Each query can be represented by two integers L and R. The task is to… Read More »

Pairing Heap is like a simplified form Fibonacci Heap. It also maintains the property of min heap which is parent value is less than its… Read More »

It is highly recommended to see previous articles on Van Emde Boas Tree first. Procedure for Insert : If no keys are present in the… Read More »

Given an array arr[] of size N. The task is to find smaller elements on the right side and greater elements on the left side… Read More »

Extendible Hashing is a dynamic hashing method wherein directories, and buckets are used to hash data. It is an aggressively flexible method in which the… Read More »

We have discussed Gap buffer and insert operations. In this post, delete operation is discussed. When we want to delete a character these three cases… Read More »

It is highly recommended to fully understand Proto Van Emde Boas Tree. Van Emde Boas Tree supports search, successor, predecessor, insert and delete operations in… Read More »

B*-tree of order m is a search tree that is either empty or that satisfies three properties: The root node has minimum two and maximum… Read More »

Please see previous articles on Proto Van Emde Boas Tree to understand these properly. Procedure for Insert: Base Case: If the size of Proto-VEB is… Read More »

Please check previous sets of Proto Van Emde Boas Tree article first. It is highly recommended. Procedure for delete: Base Case: If we reach at… Read More »

Please check previous sets of Proto Van Emde Boas Tree article first. It is highly recommended. Procedure for finding minimum: Base Case: If the size… Read More »

Please refer all previous articles on Proto Van Emde Boas Tree first. Successor Query Procedure: Base case: For Proto-VEB of size 2 the only possibility… Read More »

Van Emde Boas Tree supports search, minimum, maximum, successor, predecessor, insert and delete operations in O(lglgN) time which is faster than any of related data… Read More »

We will implement trie using smart pointers in C++ and OOP. Here, We have already discussed the implementation of trie data using recursion In our… Read More »