## Sorting array of strings (or words) using Trie | Set-2 (Handling Duplicates)

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.… Read More »

- Design a Chess Game
- Kth smallest element in a subarray
- Rearrange numbers in an array such that no two adjacent numbers are same
- Implement a Dictionary using Trie
- Trie Data Structure using smart pointer and OOP in C++
- Lazy Propagation in Segment Tree | Set 2
- 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]
- Persistent Trie | Set 1 (Introduction)
- Longest string in an array which matches with prefix of the given string
- Sort an array of strings based on the frequency of good words in them
- Count of strings whose prefix match with the given string to a given length k
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Introduction to R-tree
- Queries to update a given index and find gcd in range
- Queries for number of distinct elements in a subarray | Set 2
- Flipping Sign Problem | Lazy Propagation Segment Tree
- Find triplet such that number of nodes connecting these triplets is maximum
- Gap Buffer Data Structure
- Bottom-up traversal of a Trie
- Find the number of different numbers in the array after applying the given operation q times
- Search in a trie Recursively
- String Range Queries to find the number of subsets equal to a given String
- Extendible Hashing (Dynamic approach to DBMS)
- B-Tree Insert without aggressive splitting
- Insertion in a Trie recursively
- Strings from an array which are not prefix of any other string
- Arrange array elements such that last digit of an element is equal to first digit of the next element
- Van Emde Boas Tree | Set 1 | Basics and Construction
- B*-Trees implementation in C++

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.… 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… Read More »

We have briefly discussed sparse table in Range Minimum Query (Square Root Decomposition and Sparse Table) Sparse table concept is used for fast queries on… 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:… 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… 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”,… 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 »

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 »

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 »