## Find max length odd parity substring

Given a binary string str, the task is to find the maximum length of the sub-string of str that has odd parity. A binary string… 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 binary string str, the task is to find the maximum length of the sub-string of str that has odd parity. A binary string… Read More »

Given a string str, the task is to answer Q queries where every query consists of two integers L and R and we have to… Read More »

Given a string str, the task is to check whether the string contains two non-overlapping sub-strings s1 = “geek” and s2 = “keeg” such that… Read More »

Given a string str of lowercase alphabets, the task is to find all distinct palindromic sub-strings of the given string. Examples: Input: str = “abaaa”… Read More »

Given a binary string str. The task is to find the smallest positive integer C such that the binary string can be cut into C… Read More »

Given three strings str, A and B. The task is to check whether str = A + B or str = B + A where… Read More »

Given a string of lowercase, find the length of the longest substring that does not contain any palindrome as a substring. Examples: Input : str… Read More »

Given a binary string str. For n-contiguous 1s the score is updated as score = score + n2 and for n-contiguous 0s, the score is… Read More »

Given a string str and Q queries. Every query consists of a number X, the task is to print the Xth lexicographically smallest sub-string of… Read More »

Given a string S, the task is to check if we can make the string lexicographically smaller by reversing any sub-string of the given string.… Read More »

Given a string str, a character c and an integer k > 0. The task is to find the number of sub-strings that contain the… Read More »

Given a string str and a character X. The task is to find the total number of sub-strings that contain the character X at least… Read More »

Given an integer N, the task is to find the length of the longest substring containing only 4’s from the first N characters of the… Read More »

Given a string str consisting of lowercase English letters and an integer K. The task is to find the minimum length of the sub-string whose… Read More »

Given a string str and an integer N, the task is to find the number of possible sub-strings of length N. Examples: Input: str =… Read More »