## Substrings starting with vowel and ending with consonants and vice versa

Given a string s, count special substrings in it. A Substring of S is said to be special if either of the following properties is… Read More »

Given a string s, count special substrings in it. A Substring of S is said to be special if either of the following properties is… Read More »

Given a number as string s, find the sum of all the elements present in all possible subsequences of s. Examples : Input : s… Read More »

Given two strings, how to check if the two strings are equal or not. Examples: Input : ABCD, XYZ Output : ABCD is not equal… Read More »

Given a sentence in the form of a string, convert it into its equivalent mobile numeric keypad sequence. Examples : Input : GEEKSFORGEEKS Output :… Read More »

Given a string that contains only numeric digits, we need to check whether that strings contains numbers in consecutive sequential manner in increasing order. Note:… Read More »

Given a string ‘s’ and an integer k, find other string ‘t’ such that ‘t’ is the largest subsequence of given string ‘s’ and each… Read More »

Given an integer k and two strings str1 and str2 determine whether or not we can convert str1 to str2 by performing exactly k of… Read More »

Given two strings s1, s2 and K, find the length of the longest subsequence formed by consecutive segments of at least length K. Examples: Input… Read More »

Given a string of balanced expression, find if it contains a redundant parenthesis or not. A set of parenthesis are redundant if same sub-expression is… Read More »

Given a string containing alphabets in lowercase and uppercase, find the maximum count of distinct lowercase alphabets present between two uppercase alphabets. Examples : Input… Read More »

There are two string operators. The first is the concatenation operator (‘.‘), which returns the concatenation of its right and left arguments. The second is… Read More »

DFA (Deterministic Finite Automaton or Acceptor) is a finite state machine that accepts or rejects strings of symbols. DFA accepts the string if it reaches… Read More »

Given a string str. Check if it is possible to convert the string into palindrome string by changing only one character. Examples: Input : str… Read More »

Given a matrix of characters containing only lowercase letters, form a new string from the matrix that remain after removing the duplicate characters from each… Read More »

Given a string s and Q number of queries. Each query Q consists of l and r and a character c. Find frequency of character… Read More »