## Range Update Queries to XOR with 1 in a Binary Array.

Given a binary array arr[] of size N. The task is to answer Q queries which can be of any one type from below: Type… 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
- How Coronavirus outbreak can end | Visualize using Data structures
- Design a data structure that supports insert, delete, getRandom in O(1) with duplicates
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Design a Queue data structure to get minimum or maximum in O(1) time
- Difference between B tree and B+ tree
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Median of sliding window in an array | Set 2
- Finding shortest path between any two nodes using Floyd Warshall Algorithm
- Ackermann Function
- Paranthesis Theorem
- XOR of elements in a given range with updates using Fenwick Tree
- Types of Tries
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- Maximum CPU Load from the given list of jobs
- Build a segment tree for N-ary rooted tree
- Queries to check if any non-repeating element exists within range [L, R] of an Array
- Proof that traveling salesman problem is NP Hard
- Sum and Maximum of elements in array from [L, R] before and after updates
- Lexicographical smallest number after at most K consecutive swaps
- Range Sum and Update in Array : Segment Tree using Stack
- Sum of prime numbers in range [L, R] from given Array for Q queries
- 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
- Static and Dynamic data structures in Java with Examples
- Check if a Tree can be split into K equal connected components
- Count of elements in an Array whose set bits are in a multiple of K

Given a binary array arr[] of size N. The task is to answer Q queries which can be of any one type from below: Type… Read More »

Given a graph with N nodes and their values defined in array A, the task is to find the largest component size in a graph… Read More »

Given an array arr[] of N elements and two integers A to B, the task is to answer Q queries each having two integers L… Read More »

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to an optimal limit. Given an array of strings. The… Read More »

Given a string S consisting of small English letters and a string W consisting of weight of all characters of English alphabet where for all… Read More »

Given an integer M which represents an array initially having numbers 1 to M. Also given is a Query array. For every query, search the… Read More »

The Count-min sketch is a probabilistic data structure. The Count-Min sketch is a simple technique to summarize large amounts of frequency data. Count-min sketch algorithm… Read More »

A trie is a tree-like information retrieval data structure whose nodes store the letters of an alphabet. It is also known as a digital tree… Read More »

Prerequisites: Segment Tree Given a number N which represents the size of the array initialized to 0 and Q queries to process where there are… Read More »

Prerequisite: Segment Trees Given a binary array arr[] consisting of only 0’s and 1’s and a 2D array Q[][] consisting of K queries, the task… Read More »

Given an array arr[] of size N and a set Q[][] containing M queries, the task is to execute the queries on the given array… Read More »

Given a string P consisting of small English letters and a string Q consisting of weight of all characters of English alphabet such that for… Read More »

Given an array of jobs with different time requirements, where each job consists of start time, end time and CPU load. The task is to… Read More »

Given an array arr[] of N integers. The task is to do the following operations: Add a value X to all the element from from… Read More »

Given Adjacency List representation of a tree and an integer K., the task is to find whether the given tree can be split into K… Read More »