## Queries for count of array elements with values in given range with updates

Given an array arr[] of size N and a matrix Q consisting of queries of the following two types: 1 L R : Print the… 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
- 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.
- Difference between B tree and B+ tree
- Count all sub-strings with weight of characters atmost K

Given an array arr[] of size N and a matrix Q consisting of queries of the following two types: 1 L R : Print the… Read More »

Prerequisites: Policy based data structure, Sliding window technique. Given an array of integer arr[] and an integer K, the task is to find the median… Read More »

Prerequisites: Graham Scan’s Convex Hull, Orientation. Given a set of N points in a coordinates plane, the task is to find the maximum distance between… Read More »

Given a string S of length N, and Q queries of the following type: Type 1: 1 i X Update the i-th character of the… Read More »

Given an array arr[] of N numbers. We can merge two adjacent numbers into one and the cost of merging the two numbers is equal… Read More »

Given a graph and two nodes u and v, the task is to print the shortest path between u and v using the Floyd Warshall… Read More »

Given two N-ary trees having M nodes each. Also, given their edges and their roots respectively. The task is to check if they are isomorphic… Read More »

Given a non-cyclic graph having V nodes and E edges and a source node S, the task is to calculate the sum of the minimum… Read More »

Given an array arr[] of size N and Q queries of the form [L, R], the task is to find the number of distinct values… Read More »

Binary Space Partitioning is implemented for recursively subdividing a space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise… Read More »

Given a set of strings S and a string patt the task is to autocomplete the string patt to strings from S that have patt… Read More »

Given an array arr[] of size N, the task is to find the number of times the array can be partitioned repetitively into two subarrays… Read More »

Given an array arr[] of N positive integers and two positive integers S and K, the task is to reach the position of the array… Read More »

Given an array arr[], the task is to count the number of the unique arrays can be formed by updating the elements of the given… Read More »

Given an array A[] of length N, where N is an even number, the task is to answer Q independent queries where each query consists… Read More »