Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Misc7.7K+ articles

Arrays4.2K+ articles

Strings2.1K+ articles

Searching1.0K+ articles

Tree911+ articles

Bitwise-XOR443+ articles

Advanced Data Structure306+ articles

prefix148+ articles

Trie

86 posts

Short Note on Trie

Last Updated: 23 February 2026

A Trie is a special tree used to store words (or sequences of 0s and 1s). It is also called a prefix tree because it is very good at handling words that share the same sta...read more

article_image

Commonly Asked Data Structure Interview Questions on Tries

Last Updated: 23 July 2025

A Trie (also known as a prefix tree) is a specialized tree-based data structure that is primarily used to store a dynamic set of strings, where keys are usually strings. I...read more

article_image

Advanced Data Structure

Add and Search Word - Data Structure Design

Last Updated: 23 July 2025

Design a data structure GFGDictionary that enables to support the feature of adding new words and searching for words. The GFGDictionary class should have the following im...read more

Interview-Questions

Longest Valid Word with All Prefixes

Last Updated: 03 July 2025

Given an array of strings arr[], find the longest string such that all of its prefixes are also present in arr[]. If there are multiple such strings with the same maximum ...read more

Maximizing Distance in Binary Strings

Last Updated: 23 July 2025

Given an array of binary strings arr[] of size N (1 = N = 103). The task is to find the maximum distance between any pair of these binary strings. The distance between two...read more

Geeks Premier League

Geeks Premier League 2023

Count of given Strings in 2D character Array using Trie

Last Updated: 30 November 2023

Counting the number of occurrences of a given string in a 2D character array using a Trie.Examples:Input: vectorstring grid = {"abcde", "fghij", "xyabc", "klmno",}; s...read more

Geeks Premier League

Geeks Premier League 2023

Trie meaning in DSA

Last Updated: 23 July 2025

Trie data structure is defined as a Tree based data structure that is used for storing some collection of strings and performing efficient search operations on them.The wo...read more

article_image

Advanced Data Structure

Definitions and Meanings

Construct a String from another String using Suffix Trie

Last Updated: 23 November 2023

A suffix tree is a data structure based on trie compression that stores all the suffixes of a given string. Apart from detecting patterns in strings, it has a range of app...read more

article_image

Maximum XOR of Two Nodes in a Tree

Last Updated: 23 July 2025

Given a binary tree, where each node has a binary value, design an efficient algorithm to find the maximum XOR of any two node values in the tree.Examples:Input: 1 / ...read more

Maximum common prefix of all strings

Last Updated: 23 July 2025

Given array A[] of strings of size N, the task for this problem is to print the Maximum Common prefix of string 'i' with other strings from 1 to N apart from 'i' itself fo...read more

Hash Table vs Trie

Last Updated: 15 December 2022

What is Hash Table?An array that stores pointers to records corresponding to a given element. An entry in the hash table is NIL if no existing element has a hash function ...read more

Technical Scripter

Technical Scripter 2022

Count of Strings of Array having given prefixes for Q query

Last Updated: 23 July 2025

Given two arrays of strings containing words[] and queries[] having N and Q strings respectively, the task is to find the number of strings from words[] having queries[i] ...read more

Pattern Searching

Technical Scripter

Technical Scripter 2022

Maximum number of Strings with Common Prefix of length K

Last Updated: 23 July 2025

Given a string array arr[] of length N, the task is to find the maximum number of strings that share a common prefix of length K.Examples:Input: arr = { { "hello", "heydee...read more

Technical Scripter

Technical Scripter 2022

Trie Data Structure - Commonly Asked Questions

Last Updated: 01 September 2025

The trie data structure, also known as a prefix tree, is a tree-like data structure used for efficient retrieval of key-value pairs. It is commonly used for implementing d...read more

article_image

Applications, Advantages and Disadvantages of Trie

Last Updated: 23 July 2025

Trie(pronounced as "try"): Trie(also known as the digital tree or prefix tree) is a sorted and efficient tree-based special data structure that is used to store and retrie...read more

article_image

1 2 3 4 5 6