Given a string, inplace remove all occurrences of “AB” and “C” from it.
Given a text, find all occurrences of a given pattern in it.
Given a list of words, efficiently group all anagrams together. X and Y are anagrams if by rearranging the letters of X, we can get Y using all the original letters of X exactly once.
Given a string, find first K non-repeating characters in it by doing only single traversal of it. For example, if the string is ABCDBAGHCHFAC and K = 3, output would be D G F
Given a list of words and a pattern, find all words in the list that follows same order of characters as that of given pattern.
Given N lists of characters and a number whose digits lies between [1-N], print all possible combinations by replacing its digits with characters of the corresponding list. If any digit of the number gets repeated, it should be replaced by same character considered in its previous occurrence.
Given a sequence of numbers between [2-9], print all possible combinations of words formed from mobile keypad have some digits associated with each key.
Given a string, find all possible palindromic substrings in it.
Given two strings, determine if they are isomorphic. Two strings X and Y are called isomorphic if all occurrences of each character in X can be replaced with another character to get Y and vice-versa.
Find all interleavings of given strings that can be formed from all the characters of first and second string where order of characters is preserved.
Given a binary pattern that contains ‘?’ wildcard character at few positions, find all possible combinations of binary strings that can be formed by replacing the wildcard character by either 0 or 1.
Given two strings, determine if they are anagrams or not. Any word that exactly reproduces the letters in another order is an anagramap. In other words, X and Y are anagrams if by rearranging the letters of X, we can get Y using all the original letters of X exactly once.