# Category Archives: Advanced Data Structure

## Minimum Word BreakNovember 17, 2017

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 »

## Count greater nodes in AVL treeOctober 24, 2017

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 »

## Burrows – Wheeler Data Transform Algorithm

What is the Burrows – Wheeler Transform? The BWT is a data transformation algorithm that restructures data in such a way that the transformed message… Read More »

## Segment tree | Efficient implementationOctober 19, 2017

Let us consider the following problem to understand Segment Trees without recursion. We have an array arr[0 . . . n-1]. We should be able… Read More »

## Wavelet Trees | IntroductionOctober 18, 2017

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 »

## Trie memory optimization using hash mapSeptember 26, 2017

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 »

## Longest word in ternary search treeSeptember 7, 2017

Given a set of words represented in a ternary search tree, find the length of largest word among them. Examples: Input : {“Prakriti”, “Raghav”, “Rashi”,… Read More »

## Counting the number of words in a TrieAugust 17, 2017

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 »

## Order statistic tree using fenwick tree (BIT)August 4, 2017

Given an array of integers with limited range (0 to 1000000). We need to implement an Order statistic tree using fenwick tree. It should support… Read More »

## Leftist Tree / Leftist HeapAugust 2, 2017

A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s-value (or rank… Read More »

## Trie | (Display Content)July 26, 2017

Trie is an efficient information retrieval data structure. In our previous post on trie we have discussed about basics of trie and how to insert… Read More »

## Ternary Search Tree (Deletion)July 22, 2017

In the SET 1 post on TST we have described how to insert and search a node in TST. In this article we will discuss… Read More »

## Skip List | Set 3 (Searching and Deletion)July 6, 2017

In previous article Skip List | Set 2 (Insertion) we discussed the structure of skip nodes and how to insert an element in the skip… Read More »

## Skip List | Set 2 (Insertion)July 5, 2017

We have already discussed the idea of Skip list and how they work in Skip List | Set 1 (Introduction). In this article, we will… Read More »

## Find maximum XOR of given integer in a stream of integersJune 28, 2017

You are given a number of queries Q and each query will be of the following types: Query 1 : add(x) This means add x… Read More »