Given a string and a dictionary of words, determine if string can be segmented into a space-separated sequence of one or more dictionary words.
In this post, we will discuss C++ implementation of Trie Data Structure which supports insertion, deletion and search operations.
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 implement Trie data structure in Java.
Find duplicate rows present in a given binary matrix by traversing the matrix only once.
Given a huge set of strings with duplicate strings present, find first k-maximum occurring words in it.
Given a huge set of strings with duplicate strings present, find the maximum occurring word in it. If two words have same count, return any one of them.
Given a set of strings, print them in Lexicographic order (dictionary/alphabetical order).
Find Longest Common Prefix (LCP) in given set of strings.
In this post, we will cover memory efficient Trie implementation in C++ using map data structure.
Implement insert, search and delete operations on Trie Data structure. Assume that input consist of lowercase letters a-z.