## Extendible Hashing (Dynamic approach to DBMS)

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 »

- Design a Chess Game
- Kth smallest element in a subarray
- Implement a Dictionary using Trie
- Rearrange numbers in an array such that no two adjacent numbers are same
- Trie Data Structure using smart pointer and OOP in C++
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Persistent Trie | Set 1 (Introduction)
- Sort an array of strings based on the frequency of good words in them
- Longest string in an array which matches with prefix of the given string
- Count of strings whose prefix match with the given string to a given length k
- Queries for number of distinct elements in a subarray | Set 2
- Queries to update a given index and find gcd in range
- Flipping Sign Problem | Lazy Propagation Segment Tree
- Search in a trie Recursively
- Extendible Hashing (Dynamic approach to DBMS)
- Bottom-up traversal of a Trie
- Find the number of different numbers in the array after applying the given operation q times
- Gap Buffer Data Structure
- Count inversions in an array | Set 4 ( Using Trie )
- String Range Queries to find the number of subsets equal to a given String
- B*-Trees implementation in C++
- Insertion in a Trie recursively
- B-Tree Insert without aggressive splitting
- Van Emde Boas Tree | Set 1 | Basics and Construction
- Shortest cycle in an undirected unweighted graph
- Strings from an array which are not prefix of any other string
- Maximise the number of toys that can be purchased with amount K using min Heap
- Arrange array elements such that last digit of an element is equal to first digit of the next element
- Index of kth set bit in a binary array with update queries
- Number of triplets in array having subarray xor equal

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 »

Given an array arr of size N. The task is to find the kth smallest element in the subarray(l to r, both inclusive). Note :… Read More »

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to an optimal limit (key length). Given a trie. The… Read More »

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to an optimal limit (key length). The task is to… Read More »

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to an optimal limit (key length). Given multiple strings. The… Read More »

Implement a dictionary using Trie such that if the input is a string representing a word, the program prints its meaning from the prebuilt dictionary.… Read More »