## Count of sub-strings that do not consist of the given character

Given a string str and a character c. The task is to find the number of sub-strings that do not consist of the character c.… 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
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Largest substring with same Characters
- Count of substrings which contains a given character K times
- Minimum number of sub-strings of a string such that all are power of 5
- Number of sub-strings that contain the given character exactly 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
- Length of the longest substring that do not contain any palindrome
- 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
- Check whether given string can be generated after concatenating given strings
- Queries to find the last non-repeating character in the sub-string of a given string
- Check if string can be made lexicographically smaller by reversing any substring
- 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
- Count of sub-strings that contain character X at least once
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Reverse the given string in the range [L, R]

Given a string str and a character c. The task is to find the number of sub-strings that do not consist of the character c.… Read More »

Given a string S. The task is to count the non-overlapping pairs of palindromic sub-strings S1 and S2 such that the strings should be S1[L1…R1]… Read More »

Given a string str, the task is to find the length of the longest sub-string which does not have any pair of consecutive same characters.… Read More »

Given a string str, the task is to find the count of all the sub-strings of length four whose characters can be rearranged to form… Read More »

Given an integer N, the task is to generate all possible binary strings of length N which contain “01” as the sub-string exactly twice. Examples:… Read More »

Given a string str consisting only of the characters ‘a’, ‘b’ and ‘c’, find the number of sub-strings that do not contain all the three… Read More »

Given a string S and a range [L, R]. The task is to find the number of ways in which the sub-string in the range… Read More »

Every state is represented by string of length 2. For example DL is used for Delhi, HP for Himachal Pradesh, UP for Uttar Pradesh, PB… Read More »

Given a string str and an integer K, the task is to check whether the given string is K-periodic. A string is k-periodic if the… Read More »

Given a string S and a number K. The task is to find the minimum length substring having exactly K distinct characters. Note: The string… Read More »

Given 3 strings S, A and B. The task is to replace every sub-string of S equal to A with B and every sub-string of… Read More »

Given two strings a and b, the task is to count the number of common divisors of both the strings. A string s is a… Read More »

Given a string str and an integer k. The task is to count the occurrences of sub-strings of length k that consist of the same… Read More »

Given a integer k and a sting str, the task is to count the number of distinct sub-strings such that each sub-string does not contain… Read More »

Given a string S containing lowercase latin letters. A character c is called K-amazing if every substring of S with length atleast K contains this… Read More »