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.
Category: String
Lexicographic sorting of a given set of keys
Lexicographic sorting: Given a set of strings, print them in lexicographic order (dictionary/alphabetical order).
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.
Wildcard Pattern Matching
Given a string and a pattern containing wildcard characters, i.e., * and ?’, where ? can match to any single character in the string and * can match to any number of characters including zero characters, design an efficient algorithm to find if the pattern matches with the complete string or not.
std::prev_permutation | Overview and Implementation in C++
This post discusses std::prev_permutation, which can be used to find the lexicographically smaller permutations of a string.
Generate all permutations of a string in Java – Recursive and Iterative
Generate all permutations of a string in Java.
Decode a given sequence to construct a minimum number without repeated digits
Given a sequence consisting of I and D, where I denotes the increasing sequence and D denotes the decreasing sequence, decode the sequence to construct a minimum number without repeated digits.
std::next_permutation | Overview and Implementation in C++
This post discusses std::next_permutation, which can be used to find the lexicographically greater permutations of a string.
Find the shortest route in a device to construct a given string
Given a device having left, right, top, and bottom buttons and an OK button to enter a text from a virtual keypad having alphabets from A–Y arranged in a 5 × 5 grid. Find the shortest route in the device to construct a given string if we start from the top-left position in the keypad.
Combinations of words formed by replacing given numbers with corresponding alphabets
Given a set of positive numbers, find all possible combinations of words formed by replacing the continuous digits with the English alphabet’s corresponding character.
Word Break Problem – Dynamic Programming
Given a string and a dictionary of words, determine if the string can be segmented into a space-separated sequence of one or more dictionary words.
Count the number of times a pattern appears in a given string as a subsequence
Given a string, count the number of times a given pattern appears in it as a subsequence.