## Queries for the number of nodes having values less than V in the subtree of a Node

Given a rooted tree (assume root is 1) of N nodes and Q queries, each of the form (Val, Node). For each query, the task… Read More »

- Design a Chess Game
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Kth smallest element in a subarray
- Rearrange numbers in an array such that no two adjacent numbers are same
- Lazy Propagation in Segment Tree | Set 2
- Trie Data Structure using smart pointer and OOP in C++
- Range Queries to Find number of sub-arrays with a given xor
- Given an array and two integers l and r, find the kth largest element in the range [l, r]
- Implement a Dictionary using Trie
- Longest string in an array which matches with prefix of the given string
- Persistent Trie | Set 1 (Introduction)
- Count of strings whose prefix match with the given string to a given length k
- Sort an array of strings based on the frequency of good words in them
- Introduction to R-tree
- Flipping Sign Problem | Lazy Propagation Segment Tree
- Queries to update a given index and find gcd in range
- Find triplet such that number of nodes connecting these triplets is maximum
- Find the number of different numbers in the array after applying the given operation q times
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Gap Buffer Data Structure
- Find a pair from the given array with maximum nCr value
- Bottom-up traversal of a Trie
- B-Tree Insert without aggressive splitting
- Arrange array elements such that last digit of an element is equal to first digit of the next element
- Search in a trie Recursively
- Strings from an array which are not prefix of any other string
- Index of kth set bit in a binary array with update queries
- Insertion in a Trie recursively
- Queries for number of distinct elements in a subarray | Set 2
- B*-Trees implementation in C++

Given a rooted tree (assume root is 1) of N nodes and Q queries, each of the form (Val, Node). For each query, the task… Read More »

It is highly recommended to read the previous articles on Van Emde Boas Tree first. Procedure for successor: Base case: If the size of the… Read More »

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 »