## Split the binary string into substrings with equal number of 0s and 1s

Given a binary string str of length N, the task is to find the maximum count of substrings str can be divided into such that… 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
- Find distinct characters in distinct substrings of a string
- 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
- 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
- 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]
- 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
- Contiguous unique substrings with the given length L
- Find the longest sub-string which is prefix, suffix and also present inside the string | Set 2

Given a binary string str of length N, the task is to find the maximum count of substrings str can be divided into such that… Read More »

Given a string str, the task is to check whether all the substrings of length ≥ 2 have the number of vowels at least as… Read More »

Given a string str of length N and Q queries where every query consists of two integers L and R. For every query, the task… Read More »

Given a string S, the task is to find the number of ways to divide/partition the given string in sub-strings S1, S2, S3, …, Sk… Read More »

Given two strings str1 and str2, the task is to find the maximum number of times str1 occurs in str2 as a non-overlapping substring after… Read More »

Given a string str and a string array arr[], the task is to find the minimum count of substrings this can be splitted into such… Read More »

Given an integer N, the task is to count the number of binary strings possible of length N such that they don’t contain “111” as… Read More »

Given a string str and a character K, the task is to find the count of all the substrings of str that contain the character… Read More »

Given a string str and an integer L. The task is to print all the unique substring of length L from string str. Examples: Input:… Read More »

Given a string. The task is to find out the numbers of substrings consisting of the same characters. Examples: Input: abba Output: 5 The desired… Read More »

Given string str. The task is to find the longest sub-string which is a prefix, a suffix and a sub-string of the given string, str.… Read More »

Given string str, the task is to find the length of the longest substring of str such that no three consecutive characters in the substring… Read More »

Given a string str, and two integers L and R, the task is to reverse the string in the range [L, R] i.e. str[L…R]. Examples:… Read More »

Given two string str1 and str2, the task is to find the longest prefix of str1 which is present as a substring of the string… Read More »

Given a string S. The task is to check whether it is possible to rearrange the string such that every substring of odd length is… Read More »