## Longest substring that starts with X and ends with Y

Given a string str, two characters X and Y. The task is to find the length of the longest substring that starts with X and… Read More »

- Length of the smallest substring which contains all vowels
- Count of substrings of length K with exactly K distinct characters
- Shortest Palindromic Substring
- Check if the given string is shuffled substring of another string
- Longest Palindrome in a String formed by concatenating its prefix and suffix
- Maximum number of set bits count in a K-size substring of a Binary String
- Maximize count of 0s in left and 1s in right substring by splitting given Binary string
- Count of distinct characters in a substring by given range for Q queries
- Lexicographically all Shortest Palindromic Substrings from a given string
- Lexicographically smallest K-length substring containing maximum number of vowels
- Count of K-size substrings having palindromic permutations
- Construct a string of length L such that each substring of length X has exactly Y distinct letters
- First substring whose reverse is a word in the string
- Minimum length of substring whose rotation generates a palindromic substring
- Find length of longest substring with at most K normal characters
- Number of substrings with length divisible by the number of 1's in it
- Queries to find frequencies of a string within specified substrings
- Count of all unique substrings with non-repeating characters
- Reverse the substrings of the given String according to the given Array of indices
- Jaro and Jaro-Winkler similarity
- Permutation of given string that maximizes count of Palindromic substrings
- Check if a substring can be Palindromic by replacing K characters for Q queries
- Count of all sub-strings with sum of weights at most K
- Longest substring with atmost K characters from the given set of characters
- Check if there exists a permutation of given string which doesn't contain any monotonous substring
- Count of substrings whose Decimal equivalent is greater than or equal to K
- Longest equal substring with cost less than K
- Count of Substrings that can be formed without using the given list of Characters
- Longest substring that starts with X and ends with Y
- Count of substrings consisting only of vowels

Given a string str, two characters X and Y. The task is to find the length of the longest substring that starts with X and… Read More »

Given a string str consisting of lowercase alphabets, the task is to find the number of possible substrings (not necessarily distinct) that consists of distinct… Read More »

Given a string str, the task is to check if it can be split into substrings such that each substring starts with a numeric value… Read More »

Given a string S of length N, consisting of only opening ‘(‘ and closing ‘)‘ parenthesis. The task is to find all indices ‘K‘ such… Read More »

Given a string S, the task is to find the number of ways to split the given string S into two non-empty palindromic strings. Examples:… Read More »

Given a string str and an array arr[] of K characters, the task is to find the number of substrings of str that contains characters… Read More »

Given a string str of length N, the task is to decrypt it using a given set of decryption rules and print the decrypted string.… Read More »

Given a string str of length N, the task is to find the longest substring which contains only vowels using Binary Search technique. Examples: Input:… Read More »

Given a string str of lowercase alphabets, the task is to remove minimum characters from the given string so that string can be break into… Read More »

Prerequisite: Introduction to Deterministic Finite Automata Construct a DFA that accepts a string str starting with input alphabet ‘a’ but does not contain ‘aab’ as… Read More »

Given a string str of size N and an integer K, the task is to generate a string whose substrings of size K can be… Read More »

Given a string str of size N and an integer K, the task is to check if the input string can be partitioned into substrings… Read More »

Given a string str of size N, the task is to print the number of substrings formed after maximum possible partitions such that no two… Read More »

Given a binary string str of size N and a positive integer K, the task is to find the minimum number of flips required to… Read More »

Given a string str and an integer K, the task is to find the length of the longest sub-string S such that every character in… Read More »