## Contiguous subsegments of a string having distinct subsequent characters

Given a string str of length L and an integer N, the task is to form a total of (L / N) contiguous subsegments of… Read More »

- Minimum number of times A has to be repeated such that B is a substring of it
- Largest substring with same Characters
- Maximum number of given operations to remove the entire string
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Count number of substrings of a string consisting of same characters
- Count all substrings having character K
- Frequency of a substring in a string using pthread
- 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
- 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 string str of length L and an integer N, the task is to form a total of (L / N) contiguous subsegments of… Read More »

Given a binary string str of length N, the task is to find the count of substrings of str which are divisible by 2. Leading… Read More »

Given a binary string S of length N and an integer K, the task is to find the smallest non-zero sub-string of S that can… Read More »

Given a string str and an integer K, the task is to print the length of the longest possible substring that has exactly K unique… Read More »

Given a binary string str of length N, the task is to find the longest sub-string divisible by 2. If no such sub-string exists then… Read More »

Given a string str that consists of lower case English letters and brackets. The task is to reverse the substrings in each pair of matching… Read More »

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 »