## Check if a string contains a palindromic sub-string of even length

S is string containing only lowercase English alphabets. We need to find if there exists at least one palindromic sub-string whose length is even. Examples:… Read More »

- Count substrings that contain all vowels | SET 2
- Minimum number of times A has to be repeated such that B is a substring of it
- Largest substring with same Characters
- Count of substrings which contains a given character K times
- Maximum length palindromic substring such that it starts and ends with given char
- Queries to check if string B exists as substring in string A
- Find distinct characters in distinct substrings of a string
- Count number of distinct substrings of a given length
- Maximum number of given operations to remove the entire string
- Queries to find the first non-repeating character in the sub-string of a string
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Number of balanced parenthesis substrings
- Queries to find the last non-repeating character in the sub-string of a given string
- Count number of substrings of a string consisting of same characters
- Count all substrings having character K
- Count of non-overlapping sub-strings "101" and "010" in the given binary string
- Frequency of a substring in a string using pthread
- Rearrange given string to maximize the occurrence of string t
- Longest sub string of 0's in a binary string which is repeated K times
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Reverse the given string in the range [L, R]
- Check if a string contains two non overlapping sub-strings "geek" and "keeg"
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Repeat substrings of the given String required number of times
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Largest substring of str2 which is a prefix of str1
- Longest substring such that no three consecutive characters are same
- Largest sub-string where all the characters appear at least K times

S is string containing only lowercase English alphabets. We need to find if there exists at least one palindromic sub-string whose length is even. Examples:… Read More »

Given a string ‘str’, two integers ‘k’ and ‘p’. The task is to count all the sub-strings of ‘str’ having exactly ‘k’ characters that have… Read More »

Given a string ‘S’ (composed of digits) and an integer ‘X”, the task is to count all the sub-strings of ‘S’ that satisfy the following… Read More »

Given a string ‘s’ check if all of its palindromic sub-strings are of odd length or not. If yes then print “YES” or “NO” otherwise.… Read More »

Given a string S. The task is to print the K-th lexicographically smallest one among the different substrings of s. A substring of s is… Read More »

Given a string ‘str’ and an integer ‘k’, the task is to count the number of sub-strings of length ‘k’ which are comprised of the… Read More »

Given a string ‘s’, the task is to check whether the string has both prefix and suffix substrings of length greater than 1 which are… Read More »

Given a string S consisting of lowercase characters(a-z) only, the task is to print a new string by rearranging the string in such a way… Read More »

Suppose we are given a string s1, we need to the find total number of substring(including multiple occurrences of the same substring) of s1 which… Read More »

Given an integer N, the task is to print all the substring of N without doing any conversion i.e converting it into a string or… Read More »