Trie has the following properties for a set of strings: 1. The root node always represents the null node. 2. Every node's child is arranged alphabetically. 3. Each node can have a maximum of 26 children (A to Z). 4. Except for the root, each node can store one letter of the alphabet.
Longest Common Prefix Matching
By saksham
● Published At Oct 2021
In this blog, we will learn how we can solve an all-time classic interview problem, “Longest common prefix matching”, using a very interesting data structure, i.e., Tries.... Keep reading ..
Pattern Searching using a Trie of all Suffixes
By Malay Gain
● Published At Jan 2022
In this article, we will learn how to implement pattern Searching using a Trie of all Suffixes.... Keep reading ..
Implement a Dictionary using Trie
By dhruv sharma
● Published At Dec 2021
This article will cover the approach and the implementation of building a dictionary of words with their meanings using Trie.... Keep reading ..
Longest Common Prefix Using Trie
By Riya
● Published At Feb 2022
This article will discuss how to find the longest common prefix using trie, its C++ implementation, and its time and space complexity.... Keep reading ..
Container With Most Water
By Harsh Goyal
● Published At Nov 2021
This article will discuss the container with the most water problem and various ways to solve this problem, starting from the brute force approach to the efficient approach.... Keep reading ..
Aho-corasick Algorithm
By Manan Singhal
● Published At May 2022
This article discusses the Aho-Corasick Algorithm, one of the most famous string pattern matching algorithms.... Keep reading ..
puzzle icon

Top Problems related to Trie