Problems
With the help of Trie, we can solve different problems like 1. Longest Prefix Matching 2. Print unique rows in a given boolean matrix 3. Implementation of reverse DNS Lookup Cache and Forward DNS Lookup Cache 4. Implementing Fenwick Tree and much more...
Pattern Searching using Trie
By Pranav Gautam
● Published At Oct 2021
Implement pattern searching using a trie. Create a suffix tree using all possible suffixes of a given string. ... Keep reading ..
Longest word in dictionary
By Pranav Gautam
● Published At Nov 2021
Learn to find the longest word in a dictionary with all the prefixes present as words in the dictionary. ... Keep reading ..
Implement Forward DNS Look Up Cache
By Aditya Narayan Mishra
● Published At Jan 2022
This article is based on DNS caching and how to implement forward DNS look up cache using the Trie data structure.... Keep reading ..
Implement Reverse DNS Look Up Cache
By Aditya Narayan
● Published At Jan 2022
This article is based on DNS caching and how to implement reverse DNS look up cache using the Trie data structure.... Keep reading ..