# Category Archives: Advanced Data Structure

Self Organizing list is a list that re-organizes or re-arranges itself for better performance. In a simple list, an item to be searched is looked… Read More
We have an array arr[]. We need to find the sum of all the elements in the range L and R where 0 <= L… Read More
Given an array of strings, print them in alphabetical (dictionary) order. If there are duplicates in input array, we need to print all the occurrences.Examples:  … Read More
Check whether a given graph contains a cycle or not. Example: Input: Output: Graph contains Cycle. Input: Output: Graph does not contain Cycle. Prerequisites: Disjoint… Read More
Decision tree algorithm falls under the category of supervised learning. They can be used to solve both regression and classification problems. Decision tree uses the… Read More
Let us consider the following problem to understand Segment Trees.We have an array arr[0 . . . n-1]. We should be able to 1 Find the… Read More
Given a string s, break s such that every substring of the partition can be found in the dictionary. Return the minimum break needed. Examples:   Given… Read More
In this article we will see that how to calculate number of elements which are greater than given value in AVL tree. Examples: Input :… Read More
What is the Burrows-Wheeler Transform? The BWT is a data transformation algorithm that restructures data in such a way that the transformed message is more… Read More
Let us consider the following problem to understand Segment Trees without recursion.We have an array arr[0 . . . n-1]. We should be able to,  … Read More
A wavelet tree is a data structure that recursively partitions a stream into two parts until we’re left with homogeneous data. The name derives from… Read More
We introduced and discussed an implementation in below post. Trie | (Insert and Search) – GeeksforGeeks The implementation used in above post uses an array… Read More
Given a set of words represented in a ternary search tree, find the length of largest word among them.Examples:   Input : {"Prakriti", "Raghav", "Rashi", "Sunidhi"}… Read More
A Trie is used to store dictionary words so that they can be searched efficiently and prefix search can be done. The task is to… Read More