Find all words matching a pattern in the given dictionary
Given a dictionary of words where each word follows a CamelCase notation, find all words in it that matches a given pattern of all uppercase characters.
Category: Tree
Generate a list of possible words from a character matrix
Given an M × N boggle board, find a list of all possible words that can be formed by a sequence of adjacent characters on the board.
Trie Data Structure – Python Implementation
Trie is a tree-based data structure used for efficient retrieval of a key in a huge set of strings. In this post, we will discuss Python implementation of Trie data structure which supports insertion and search operations.
Trie Implementation in C – Insert, Search and Delete
Implement insert, search, and delete operations on Trie data structure. Assume that the input consists of only lowercase letters a–z.
Memory Efficient C++ Implementation of Trie – Insert, Search, and Delete
This post covers memory-efficient implementation of Trie data structure in C++ using the map data structure. Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.
Longest Common Prefix in a given set of strings (Using Trie)
Find the longest common prefix (LCP) in a given set of strings.
Lexicographic sorting of a given set of keys
Lexicographic sorting: Given a set of strings, print them in lexicographic order (dictionary/alphabetical order).
Find the maximum occurring word in a given set of strings
Given a huge set of words with duplicates present, find the maximum occurring word in it. If two words have the same count, return any one of them.
Find first `k` maximum occurring words in a given set of strings
Given a huge set of words with duplicates present and a positive integer k, find the first k–maximum occurring words in it.
Find duplicate rows in a binary matrix
Find duplicate rows present in a given binary matrix by traversing the matrix only once.
Word Break Problem – Using Trie Data Structure
Given a dictionary of words, determine if a given string can be segmented into a space-separated sequence of one or more dictionary words.
C++ Implementation of Trie Data Structure
Trie is a tree-based data structure used for efficient retrieval of a key in a huge set of strings. This post covers the C++ implementation of the Trie data structure, which supports insertion, deletion, and search operations.