Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com

Last updated: Aug 2, 2022

Trie

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.

Introduction and implementation of Trie

This blog will cover the theory, implementation, discussion over time complexity and space complexity of Trie data structure.

Author Nishant Rana

1 upvote

Advantages of Trie Data Structure

In this blog, we will look into the advantages of Trie data structure and time and space complexity.

Author Sneha Mallik

0 upvotes

Suffix Tree-Ukkonen's Algorithm HARD

In this article, we will see the suffix tree- Ukkonen’s Algorithm and how it works in the coding to ensure their job.

0 upvotes

Substring Check Using Suffix Tree HARD

In this blog, we will check whether a string 'pattern' is contained in another string 'text' or not using a suffix tree.

Author Sujal Modanwal

0 upvotes

Delete nodes from trie

This blog covers deleting nodes from trie and covers the basic concepts of trie, code and algorithm of trie operations.

Author Sneha Mallik

0 upvotes

Dictionaries using Tries

This blog introduces you to one of the fascinating data structures, Tries. We will learn how to implement dictionaries using tries.

Author Husen Kagdi

1 upvote

Pattern Searching using Trie

Implement pattern searching using a trie. Create a suffix tree using all possible suffixes of a given string.

Author Pranav Gautam

1 upvote

Longest word in dictionary

Learn to find the longest word in a dictionary with all the prefixes present as words in the dictionary.

Author Pranav Gautam

0 upvotes

Implement Forward DNS Look Up Cache

This article is based on DNS caching and how to implement forward DNS look up cache using the Trie data structure.

Author Aditya Narayan Mishra +91

0 upvotes

Implement Reverse DNS Look Up Cache

This article is based on DNS caching and how to implement reverse DNS look up cache using the Trie data structure.

Author NarayanAditya

0 upvotes

Longest Common Prefix Matching

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.

0 upvotes

Implement a Dictionary using Trie

This article will cover the approach and the implementation of building a dictionary of words with their meanings using Trie.

Author dhruv sharma

1 upvote

Container With Most Water MEDIUM

This blog discusses the container with the most water problem and various approaches to solving this problem.

Author Sahil Setia

0 upvotes

Longest Common Prefix Using Trie

This article will discuss how to find the longest common prefix using trie, its C++ implementation, and its time and space complexity.

1 upvote

Aho-corasick Algorithm EASY

This article discusses the Aho-Corasick Algorithm, one of the most famous string pattern matching algorithms.

Author Manan Singhal

0 upvotes